| TraverserTest |  | 0% |  | 0% | 138 | 138 | 589 | 589 | 135 | 135 | 1 | 1 |
| GraphsTest |  | 0% |  | 0% | 59 | 59 | 484 | 484 | 56 | 56 | 1 | 1 |
| AbstractNetworkTest |  | 0% |  | 0% | 100 | 100 | 440 | 440 | 65 | 65 | 1 | 1 |
| ValueGraphTest |  | 0% |  | 0% | 57 | 57 | 324 | 324 | 51 | 51 | 1 | 1 |
| AbstractStandardDirectedNetworkTest |  | 0% |  | 0% | 87 | 87 | 371 | 371 | 81 | 81 | 1 | 1 |
| AbstractStandardUndirectedNetworkTest |  | 0% |  | 0% | 75 | 75 | 335 | 335 | 73 | 73 | 1 | 1 |
| AbstractStandardDirectedGraphTest |  | 0% | | n/a | 48 | 48 | 249 | 249 | 48 | 48 | 1 | 1 |
| AbstractStandardUndirectedGraphTest |  | 0% |  | 0% | 45 | 45 | 228 | 228 | 44 | 44 | 1 | 1 |
| AbstractGraphTest |  | 0% |  | 0% | 60 | 60 | 236 | 236 | 47 | 47 | 1 | 1 |
| EndpointPairTest |  | 0% |  | 0% | 19 | 19 | 145 | 145 | 17 | 17 | 1 | 1 |
| Graphs |  | 0% |  | 0% | 75 | 75 | 163 | 163 | 22 | 22 | 1 | 1 |
| GraphPropertiesTest |  | 0% |  | 0% | 31 | 31 | 111 | 111 | 16 | 16 | 1 | 1 |
| DirectedGraphConnections |  | 0% |  | 0% | 59 | 59 | 141 | 141 | 18 | 18 | 1 | 1 |
| ElementOrderTest |  | 0% | | n/a | 16 | 16 | 102 | 102 | 16 | 16 | 1 | 1 |
| DefaultNetworkImplementationsTest |  | 0% |  | 0% | 18 | 18 | 62 | 62 | 15 | 15 | 1 | 1 |
| AbstractNetwork |  | 0% |  | 0% | 48 | 48 | 65 | 65 | 31 | 31 | 1 | 1 |
| NetworkEquivalenceTest |  | 0% |  | 0% | 21 | 21 | 70 | 70 | 13 | 13 | 1 | 1 |
| ImmutableNetworkTest |  | 0% | | n/a | 10 | 10 | 66 | 66 | 10 | 10 | 1 | 1 |
| ImmutableValueGraphTest |  | 0% | | n/a | 13 | 13 | 83 | 83 | 13 | 13 | 1 | 1 |
| StandardMutableValueGraph |  | 0% |  | 0% | 28 | 28 | 69 | 69 | 10 | 10 | 1 | 1 |
| StandardMutableNetwork |  | 0% |  | 0% | 26 | 26 | 64 | 64 | 8 | 8 | 1 | 1 |
| NetworkMutationTest |  | 0% |  | 0% | 13 | 13 | 59 | 59 | 5 | 5 | 1 | 1 |
| AbstractBaseGraph |  | 0% |  | 0% | 34 | 34 | 39 | 39 | 19 | 19 | 1 | 1 |
| GraphMutationTest |  | 0% |  | 0% | 13 | 13 | 52 | 52 | 5 | 5 | 1 | 1 |
| GraphEquivalenceTest |  | 0% |  | 0% | 18 | 18 | 54 | 54 | 11 | 11 | 1 | 1 |
| StandardNetwork |  | 0% |  | 0% | 26 | 26 | 50 | 50 | 21 | 21 | 1 | 1 |
| StandardValueGraph |  | 0% |  | 0% | 27 | 27 | 45 | 45 | 19 | 19 | 1 | 1 |
| StandardImmutableGraphAdditionalTest |  | 0% | | n/a | 10 | 10 | 51 | 51 | 10 | 10 | 1 | 1 |
| MapCacheTest |  | 0% |  | 0% | 7 | 7 | 28 | 28 | 6 | 6 | 1 | 1 |
| IncidentEdgeSet |  | 0% |  | 0% | 24 | 24 | 32 | 32 | 6 | 6 | 1 | 1 |
| InvalidatableSetTest |  | 0% | | n/a | 11 | 11 | 24 | 24 | 11 | 11 | 1 | 1 |
| DirectedMultiNetworkConnections |  | 0% |  | 0% | 20 | 20 | 39 | 39 | 13 | 13 | 1 | 1 |
| StandardImmutableDirectedNetworkTest |  | 0% | | n/a | 5 | 5 | 26 | 26 | 5 | 5 | 1 | 1 |
| AbstractBaseGraph.new AbstractNetwork() {...} |  | 0% |  | 0% | 19 | 19 | 35 | 35 | 17 | 17 | 1 | 1 |
| ImmutableNetwork |  | 0% |  | 0% | 19 | 19 | 33 | 33 | 13 | 13 | 1 | 1 |
| ElementOrder |  | 0% |  | 0% | 25 | 25 | 31 | 31 | 13 | 13 | 1 | 1 |
| TestUtil |  | 0% |  | 0% | 9 | 9 | 33 | 33 | 8 | 8 | 1 | 1 |
| StandardMutableDirectedNetworkTest |  | 0% | | n/a | 5 | 5 | 22 | 22 | 5 | 5 | 1 | 1 |
| StandardMutableUndirectedNetworkTest |  | 0% | | n/a | 5 | 5 | 22 | 22 | 5 | 5 | 1 | 1 |
| AbstractDirectedNetworkConnections |  | 0% |  | 0% | 16 | 16 | 29 | 29 | 10 | 10 | 1 | 1 |
| ForwardingNetwork |  | 0% | | n/a | 27 | 27 | 27 | 27 | 27 | 27 | 1 | 1 |
| ValueGraphBuilder |  | 0% |  | 0% | 14 | 14 | 31 | 31 | 12 | 12 | 1 | 1 |
| GraphBuilder |  | 0% |  | 0% | 14 | 14 | 31 | 31 | 12 | 12 | 1 | 1 |
| Traverser |  | 0% |  | 0% | 16 | 16 | 23 | 23 | 13 | 13 | 1 | 1 |
| PackageSanityTests |  | 0% | | n/a | 3 | 3 | 30 | 30 | 3 | 3 | 1 | 1 |
| UndirectedMultiNetworkConnections |  | 0% |  | 0% | 17 | 17 | 28 | 28 | 11 | 11 | 1 | 1 |
| NetworkBuilder |  | 0% | | n/a | 13 | 13 | 30 | 30 | 13 | 13 | 1 | 1 |
| Graphs.TransposedNetwork |  | 0% | | n/a | 17 | 17 | 20 | 20 | 17 | 17 | 1 | 1 |
| EndpointPair |  | 0% |  | 0% | 13 | 13 | 16 | 16 | 9 | 9 | 1 | 1 |
| AbstractValueGraph |  | 0% |  | 0% | 14 | 14 | 21 | 21 | 9 | 9 | 1 | 1 |
| MapIteratorCache |  | 0% |  | 0% | 15 | 15 | 28 | 28 | 10 | 10 | 1 | 1 |
| ForwardingValueGraph |  | 0% | | n/a | 19 | 19 | 19 | 19 | 19 | 19 | 1 | 1 |
| UndirectedGraphConnections |  | 0% |  | 0% | 15 | 15 | 21 | 21 | 13 | 13 | 1 | 1 |
| StandardMutableUndirectedGraphTest |  | 0% | | n/a | 5 | 5 | 17 | 17 | 5 | 5 | 1 | 1 |
| StandardMutableDirectedGraphTest |  | 0% | | n/a | 5 | 5 | 17 | 17 | 5 | 5 | 1 | 1 |
| EndpointPair.Unordered |  | 0% |  | 0% | 13 | 13 | 17 | 17 | 7 | 7 | 1 | 1 |
| MapRetrievalCache |  | 0% |  | 0% | 13 | 13 | 30 | 30 | 6 | 6 | 1 | 1 |
| ImmutableValueGraph |  | 0% |  | 0% | 11 | 11 | 20 | 20 | 8 | 8 | 1 | 1 |
| EndpointPair.Ordered |  | 0% |  | 0% | 12 | 12 | 15 | 15 | 7 | 7 | 1 | 1 |
| DefaultNetworkImplementationsTest.NetworkForTest |  | 0% | | n/a | 17 | 17 | 19 | 19 | 17 | 17 | 1 | 1 |
| ImmutableGraph |  | 0% |  | 0% | 10 | 10 | 21 | 21 | 7 | 7 | 1 | 1 |
| ForwardingGraph |  | 0% | | n/a | 16 | 16 | 16 | 16 | 16 | 16 | 1 | 1 |
| Graphs.TransposedValueGraph |  | 0% | | n/a | 12 | 12 | 14 | 14 | 12 | 12 | 1 | 1 |
| AbstractUndirectedNetworkConnections |  | 0% |  | 0% | 14 | 14 | 20 | 20 | 11 | 11 | 1 | 1 |
| AbstractGraph |  | 0% |  | 0% | 9 | 9 | 15 | 15 | 4 | 4 | 1 | 1 |
| Traverser.Traversal |  | 0% | | n/a | 7 | 7 | 15 | 15 | 7 | 7 | 1 | 1 |
| StandardImmutableDirectedGraphTest |  | 0% | | n/a | 5 | 5 | 12 | 12 | 5 | 5 | 1 | 1 |
| StandardImmutableUndirectedGraphTest |  | 0% | | n/a | 5 | 5 | 12 | 12 | 5 | 5 | 1 | 1 |
| AbstractDirectedNetworkConnections.new AbstractSet() {...} |  | 0% |  | 0% | 7 | 7 | 7 | 7 | 4 | 4 | 1 | 1 |
| AbstractBaseGraph.new IncidentEdgeSet() {...} |  | 0% |  | 0% | 6 | 6 | 14 | 14 | 5 | 5 | 1 | 1 |
| StandardMutableGraph |  | 0% |  | 0% | 10 | 10 | 12 | 12 | 8 | 8 | 1 | 1 |
| EndpointPairIterator |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 3 | 3 | 1 | 1 |
| AbstractNetwork.1.new AbstractSet() {...} |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 5 | 5 | 1 | 1 |
| AbstractValueGraph.new AbstractGraph() {...} |  | 0% | | n/a | 13 | 13 | 13 | 13 | 13 | 13 | 1 | 1 |
| Traverser.Traversal.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 10 | 10 | 2 | 2 | 1 | 1 |
| EndpointPairIterator.Undirected |  | 0% |  | 0% | 5 | 5 | 13 | 13 | 2 | 2 | 1 | 1 |
| AbstractBaseGraph.new AbstractSet() {...} |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 5 | 5 | 1 | 1 |
| AbstractNetwork.new AbstractGraph() {...} |  | 0% |  | 0% | 11 | 11 | 12 | 12 | 10 | 10 | 1 | 1 |
| EdgesConnecting |  | 0% |  | 0% | 9 | 9 | 12 | 12 | 5 | 5 | 1 | 1 |
| Graphs.TransposedGraph |  | 0% | | n/a | 9 | 9 | 11 | 11 | 9 | 9 | 1 | 1 |
| InvalidatableSet |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 5 | 5 | 1 | 1 |
| ValueGraphTest.new Callable() {...} |  | 0% |  | 0% | 3 | 3 | 8 | 8 | 2 | 2 | 1 | 1 |
| AbstractNetworkTest.new Callable() {...} |  | 0% |  | 0% | 3 | 3 | 8 | 8 | 2 | 2 | 1 | 1 |
| DirectedNetworkConnections |  | 0% | | n/a | 6 | 6 | 9 | 9 | 6 | 6 | 1 | 1 |
| Traverser.Traversal.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 9 | 9 | 2 | 2 | 1 | 1 |
| DirectedGraphConnections.new AbstractSet() {...} |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 4 | 4 | 1 | 1 |
| DirectedGraphConnections.new AbstractSet() {...} |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 4 | 4 | 1 | 1 |
| DirectedGraphConnections.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 9 | 9 | 2 | 2 | 1 | 1 |
| ImmutableValueGraph.Builder |  | 0% | | n/a | 5 | 5 | 11 | 11 | 5 | 5 | 1 | 1 |
| ImmutableGraph.Builder |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
| DirectedGraphConnections.1.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
| ImmutableNetwork.Builder |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
| AbstractBaseGraph.3.new IncidentEdgeSet() {...} |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 3 | 3 | 1 | 1 |
| AbstractBaseGraph.3.new IncidentEdgeSet() {...} |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 3 | 3 | 1 | 1 |
| DirectedGraphConnections.new AbstractSet() {...} |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
| Traverser.Traversal.new Traverser.Traversal() {...} |  | 0% |  | 0% | 4 | 4 | 10 | 10 | 2 | 2 | 1 | 1 |
| MultiEdgesConnecting.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
| MultiEdgesConnecting |  | 0% | | n/a | 3 | 3 | 7 | 7 | 3 | 3 | 1 | 1 |
| UndirectedNetworkConnections |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
| TraverserTest.new SuccessorsFunction() {...} | | 0% |  | 0% | 4 | 4 | 4 | 4 | 2 | 2 | 1 | 1 |
| Graphs.TransposedGraph.new IncidentEdgeSet() {...} | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
| DirectedGraphConnections.2.new AbstractIterator() {...} | | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
| DirectedGraphConnections.3.new AbstractIterator() {...} | | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
| DirectedGraphConnections.2.new AbstractIterator() {...} | | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
| DirectedGraphConnections.3.new AbstractIterator() {...} | | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
| MapIteratorCache.new AbstractSet() {...} | | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
| MapIteratorCache.1.new UnmodifiableIterator() {...} | | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
| ElementOrder.Type | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 | 1 | 1 |
| EndpointPairIterator.Directed | | 0% |  | 0% | 4 | 4 | 6 | 6 | 2 | 2 | 1 | 1 |
| DirectedGraphConnections.NodeConnection.Pred | | 0% |  | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
| DirectedGraphConnections.NodeConnection.Succ | | 0% |  | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
| IncidentEdgeSet.EdgeType | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| TraverserTest.RequestSavingGraph | | 0% | | n/a | 2 | 2 | 6 | 6 | 2 | 2 | 1 | 1 |
| Traverser.Traversal.new Traverser.Traversal() {...} | | 0% |  | 0% | 3 | 3 | 6 | 6 | 2 | 2 | 1 | 1 |
| AbstractGraphBuilder | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 | 1 | 1 |
| DirectedMultiNetworkConnections.new MultiEdgesConnecting() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| StandardValueGraph.new IncidentEdgeSet() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| ElementOrderTest.NonComparableSuperClass | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
| UndirectedMultiNetworkConnections.new MultiEdgesConnecting() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Graphs.TransitiveClosureSelfLoopStrategy | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| TestUtil.EdgeType | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| Graphs.NodeVisitState | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| Traverser.InsertionOrder | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| ElementOrderTest.new Comparator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.new Traverser() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.new Traverser() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| ElementOrderTest.ComparableSubClass | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| GraphsBridgeMethods | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
| Traverser.InsertionOrder.new Traverser.InsertionOrder() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| Traverser.InsertionOrder.new Traverser.InsertionOrder() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| GraphConstants.Presence | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
| TraverserTest.new SuccessorsFunction() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| MapRetrievalCache.CacheEntry | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| DirectedGraphConnections.NodeConnection | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| DirectedGraphConnections.PredAndSucc | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| Graphs.NodeAndRemainingSuccessors | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |