| traverse(int, TraversalType, Traverser, boolean[]) |  | 0% | | 0% | 11 | 11 | 25 | 25 | 1 | 1 |
| findAllPaths(int, Predicate, Predicate, TIntArrayList, BitSet, List) | | 0% | | 0% | 7 | 7 | 23 | 23 | 1 | 1 |
| print(PrintStream, Function, Function) | | 0% | | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
| addVertexIfNotPresent(int, boolean) | | 0% | | 0% | 8 | 8 | 19 | 19 | 1 | 1 |
| getAdjacencyList() | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| traverseVertex(int, boolean[], Deque, TIntArrayList[], TraversalType) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| getEdgeObjects(int, int) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| addEdge(int, int, Object, boolean) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| UndirectedGraphImpl(int) | | 0% | | 0% | 2 | 2 | 11 | 11 | 1 | 1 |
| removeEdgeInternal(int, boolean) | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| removeVertexInternal(int, boolean) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| addVertex(boolean) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| removeVertex(int, boolean) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| findAllPaths(int, int, Predicate, Predicate, TIntArrayList, BitSet, List) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| traverse(int[], TraversalType, Traverser) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| findAllPaths(int, Predicate, Predicate, Comparator) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| removeAllEdges(boolean) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| getVertices() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| removeIsolatedVertices(int, TIntArrayList[], boolean) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| getEdges() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| cleanVertices(int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| vertexExists(int) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| removeAllVertices(boolean) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| getEdgeConnectedToVertexStream(int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| checkVertex(int) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| checkEdge(int) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| removeIsolatedVertices(boolean) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setVertexObject(int, Object, boolean) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| notifyVertexObjectSet(int, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyVertexRemoved(int, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyEdgeAdded(int, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyEdgeRemoved(int, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyEdgeBeforeRemoval(int, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyVertexAdded(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyAllEdgesBeforeRemoval(Collection) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| notifyAllEdgesRemoved(Collection) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| traverse(int, TraversalType, Traverser) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| notifyAllVerticesRemoved() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| removeEdge(int, boolean) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getVertexObject(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getEdgeVertex1(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getEdgeVertex2(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getEdgeObject(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getVertexCount() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getEdgeCount() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getVerticesObj() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getVertexObjectStream() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getEdgesConnectedToVertex(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getEdgesObject() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getEdgeObjectStream() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| findAllPaths(int, Predicate, Predicate) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addEdge(int, int, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getEdgeObjectsConnectedToVertex(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getEdgeObjectConnectedToVertexStream(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setVertexObject(int, Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| addListener(UndirectedGraphListener) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| removeListener(UndirectedGraphListener) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| addVertexIfNotPresent(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| removeVertex(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeEdge(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addVertex() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeAllVertices() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| removeAllEdges() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getVertexCapacity() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| invalidateAdjacencyList() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| removeIsolatedVertices() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |