| testTraverse() |  | 0% | | n/a | 1 | 1 | 48 | 48 | 1 | 1 |
| testPrintGraph() | | 0% | | n/a | 1 | 1 | 21 | 21 | 1 | 1 |
| testFindAllPaths() | | 0% | | n/a | 1 | 1 | 20 | 20 | 1 | 1 |
| testRemoveEdge() | | 0% | | n/a | 1 | 1 | 17 | 17 | 1 | 1 |
| testAddListenerButDisableNotification() | | 0% | | n/a | 1 | 1 | 15 | 15 | 1 | 1 |
| testTraverseParallelEdges() | | 0% | | n/a | 1 | 1 | 11 | 11 | 1 | 1 |
| removeIsolatedVertices() | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| testGetEdgesFromVertex() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testGetEdgeObjectFromVertex() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testAddListener() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| testGetVertexObjectStream() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testGetArrowObjectStream() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testAddEdge() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testGetEdges() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testRemoveAllEdges() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testAddVertexIfNotPresent() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testRemoveVertexAndAdd() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testRemoveListener() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| lambda$testRemoveVertex$6() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| testGetEdgeObjects() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| testRemoveVertexException() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| testVertexExists() | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| testGetVertices() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testGetMaxVertex() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| testRemoveAllVertices() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| testGetEdgeObject() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testGetVertexObject() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| testRemoveAllVerticesException() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testConstructor() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| testVertexNotFoundWhenAddingEdge() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| lambda$testTraverse$14(List, int, int, int) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| lambda$testTraverse$9(boolean[], int, int, int) | | 0% | | 0% | 4 | 4 | 2 | 2 | 1 | 1 |
| testEdgeNotFound() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testTraverseParallelEdges$15(List, int, int, int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testTraverse$13(List, int, int, int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testTraverse$12(List, int, int, int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testFindAllPaths$8(UndirectedGraphImplTest.Vertex) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| testAddVertex() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$testVertexNotFoundWhenAddingEdge$5() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setUp() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testAddVertexIfNotPresentNegative() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testAddVertexIfNotPresentLimit() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testTraverse$11(boolean[], int, int, int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testTraverse$10(int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$testEdgeNotFound$7() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testRemoveVertexException$3() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testConstructor$0() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testAddVertexIfNotPresentLimit$2() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$testAddVertexIfNotPresentNegative$1() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| tearDown() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| testRemoveVertex() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$testRemoveAllVerticesException$4() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| UndirectedGraphImplTest() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |