| Graphs |  | 0% |  | 0% | 75 | 75 | 161 | 161 | 19 | 19 | 1 | 1 |
| DirectedGraphConnections |  | 0% |  | 0% | 35 | 35 | 70 | 70 | 14 | 14 | 1 | 1 |
| ConfigurableMutableValueGraph |  | 0% |  | 0% | 25 | 25 | 60 | 60 | 7 | 7 | 1 | 1 |
| ConfigurableMutableNetwork |  | 0% |  | 0% | 25 | 25 | 62 | 62 | 7 | 7 | 1 | 1 |
| AbstractNetwork |  | 0% |  | 0% | 27 | 27 | 41 | 41 | 15 | 15 | 1 | 1 |
| ConfigurableNetwork |  | 0% |  | 0% | 26 | 26 | 47 | 47 | 21 | 21 | 1 | 1 |
| DirectedMultiNetworkConnections |  | 0% |  | 0% | 20 | 20 | 39 | 39 | 13 | 13 | 1 | 1 |
| ConfigurableValueGraph |  | 0% |  | 0% | 20 | 20 | 34 | 34 | 14 | 14 | 1 | 1 |
| ElementOrder |  | 0% |  | 0% | 24 | 24 | 30 | 30 | 12 | 12 | 1 | 1 |
| ImmutableNetwork |  | 0% |  | 0% | 16 | 16 | 31 | 31 | 10 | 10 | 1 | 1 |
| AbstractBaseGraph |  | 0% |  | 0% | 17 | 17 | 21 | 21 | 8 | 8 | 1 | 1 |
| Traverser.TreeTraverser |  | 0% |  | 0% | 14 | 14 | 32 | 32 | 8 | 8 | 1 | 1 |
| Traverser.GraphTraverser |  | 0% |  | 0% | 14 | 14 | 32 | 32 | 8 | 8 | 1 | 1 |
| AbstractDirectedNetworkConnections |  | 0% |  | 0% | 16 | 16 | 25 | 25 | 10 | 10 | 1 | 1 |
| Traverser.GraphTraverser.DepthFirstIterator |  | 0% |  | 0% | 13 | 13 | 21 | 21 | 3 | 3 | 1 | 1 |
| ForwardingNetwork |  | 0% | | n/a | 23 | 23 | 23 | 23 | 23 | 23 | 1 | 1 |
| AbstractBaseGraph.IncidentEdgeSet.Directed |  | 0% |  | 0% | 11 | 11 | 20 | 20 | 4 | 4 | 1 | 1 |
| UndirectedMultiNetworkConnections |  | 0% |  | 0% | 17 | 17 | 28 | 28 | 11 | 11 | 1 | 1 |
| EndpointPair |  | 0% |  | 0% | 13 | 13 | 16 | 16 | 9 | 9 | 1 | 1 |
| NetworkBuilder |  | 0% | | n/a | 12 | 12 | 28 | 28 | 12 | 12 | 1 | 1 |
| EndpointPair.Unordered |  | 0% |  | 0% | 13 | 13 | 17 | 17 | 7 | 7 | 1 | 1 |
| AbstractValueGraph |  | 0% |  | 0% | 12 | 12 | 19 | 19 | 7 | 7 | 1 | 1 |
| MapRetrievalCache |  | 0% |  | 0% | 13 | 13 | 29 | 29 | 6 | 6 | 1 | 1 |
| MapIteratorCache |  | 0% |  | 0% | 15 | 15 | 21 | 21 | 10 | 10 | 1 | 1 |
| EndpointPair.Ordered |  | 0% |  | 0% | 12 | 12 | 15 | 15 | 7 | 7 | 1 | 1 |
| ImmutableGraph |  | 0% |  | 0% | 9 | 9 | 18 | 18 | 6 | 6 | 1 | 1 |
| ImmutableValueGraph |  | 0% |  | 0% | 9 | 9 | 16 | 16 | 6 | 6 | 1 | 1 |
| Graphs.TransposedNetwork |  | 0% | | n/a | 13 | 13 | 16 | 16 | 13 | 13 | 1 | 1 |
| ForwardingValueGraph |  | 0% | | n/a | 15 | 15 | 15 | 15 | 15 | 15 | 1 | 1 |
| Traverser.GraphTraverser.BreadthFirstIterator |  | 0% |  | 0% | 8 | 8 | 15 | 15 | 3 | 3 | 1 | 1 |
| AbstractBaseGraph.IncidentEdgeSet.Undirected |  | 0% |  | 0% | 10 | 10 | 16 | 16 | 4 | 4 | 1 | 1 |
| Traverser.TreeTraverser.DepthFirstPostOrderIterator |  | 0% |  | 0% | 6 | 6 | 16 | 16 | 3 | 3 | 1 | 1 |
| AbstractUndirectedNetworkConnections |  | 0% |  | 0% | 14 | 14 | 20 | 20 | 11 | 11 | 1 | 1 |
| AbstractGraph |  | 0% |  | 0% | 9 | 9 | 15 | 15 | 4 | 4 | 1 | 1 |
| AbstractDirectedNetworkConnections.new AbstractSet() {...} |  | 0% |  | 0% | 7 | 7 | 8 | 8 | 4 | 4 | 1 | 1 |
| EndpointPairIterator |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 3 | 3 | 1 | 1 |
| UndirectedGraphConnections |  | 0% | | n/a | 11 | 11 | 15 | 15 | 11 | 11 | 1 | 1 |
| ForwardingGraph |  | 0% | | n/a | 13 | 13 | 13 | 13 | 13 | 13 | 1 | 1 |
| AbstractNetwork.1.new AbstractSet() {...} |  | 0% |  | 0% | 8 | 8 | 10 | 10 | 4 | 4 | 1 | 1 |
| Traverser.TreeTraverser.DepthFirstPreOrderIterator |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 3 | 3 | 1 | 1 |
| AbstractValueGraph.new AbstractGraph() {...} |  | 0% | | n/a | 12 | 12 | 12 | 12 | 12 | 12 | 1 | 1 |
| GraphBuilder |  | 0% | | n/a | 9 | 9 | 16 | 16 | 9 | 9 | 1 | 1 |
| ValueGraphBuilder |  | 0% | | n/a | 9 | 9 | 16 | 16 | 9 | 9 | 1 | 1 |
| AbstractBaseGraph.new AbstractSet() {...} |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 5 | 5 | 1 | 1 |
| AbstractNetwork.new AbstractGraph() {...} |  | 0% |  | 0% | 10 | 10 | 11 | 11 | 9 | 9 | 1 | 1 |
| Traverser.TreeTraverser.BreadthFirstIterator |  | 0% |  | 0% | 5 | 5 | 10 | 10 | 3 | 3 | 1 | 1 |
| EdgesConnecting |  | 0% |  | 0% | 9 | 9 | 12 | 12 | 5 | 5 | 1 | 1 |
| Graphs.TransposedValueGraph |  | 0% | | n/a | 9 | 9 | 11 | 11 | 9 | 9 | 1 | 1 |
| EndpointPairIterator.Undirected |  | 0% |  | 0% | 5 | 5 | 12 | 12 | 2 | 2 | 1 | 1 |
| DirectedNetworkConnections |  | 0% | | n/a | 6 | 6 | 9 | 9 | 6 | 6 | 1 | 1 |
| ConfigurableMutableGraph |  | 0% |  | 0% | 8 | 8 | 8 | 8 | 6 | 6 | 1 | 1 |
| Graphs.TransposedGraph |  | 0% | | n/a | 7 | 7 | 9 | 9 | 7 | 7 | 1 | 1 |
| ElementOrder.Type |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| Traverser |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 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 |
| AbstractBaseGraph.IncidentEdgeSet |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
| DirectedGraphConnections.new AbstractSet() {...} |  | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
| DirectedGraphConnections.new AbstractSet() {...} |  | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
| DirectedGraphConnections.1.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 |
| 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 |
| Traverser.Order |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| Graphs.NodeVisitState |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| AbstractNetwork.new Predicate() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| EndpointPairIterator.Directed |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 2 | 2 | 1 | 1 |
| UndirectedMultiNetworkConnections.new MultiEdgesConnecting() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| DirectedMultiNetworkConnections.new MultiEdgesConnecting() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.GraphTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.GraphTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| ImmutableNetwork.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| ImmutableValueGraph.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.TreeTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.TreeTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.TreeTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.GraphTraverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| AbstractGraphBuilder |  | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 | 1 | 1 |
| AbstractValueGraph.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| GraphConstants.Presence |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
| AbstractNetwork.1.1.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| Traverser.GraphTraverser.DepthFirstIterator.NodeAndSuccessors |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| ImmutableNetwork.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| ImmutableNetwork.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| AbstractBaseGraph.IncidentEdgeSet.Undirected.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| AbstractBaseGraph.IncidentEdgeSet.Directed.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| AbstractBaseGraph.IncidentEdgeSet.Directed.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| AbstractNetwork.new Function() {...} |  | 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.PredAndSucc | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |