Graphs |  | 0% |  | 0% | 74 | 74 | 156 | 156 | 20 | 20 | 1 | 1 |
DirectedGraphConnections |  | 0% |  | 0% | 59 | 59 | 141 | 141 | 18 | 18 | 1 | 1 |
AbstractNetwork |  | 0% |  | 0% | 47 | 47 | 65 | 65 | 30 | 30 | 1 | 1 |
StandardMutableValueGraph |  | 0% |  | 0% | 28 | 28 | 69 | 69 | 10 | 10 | 1 | 1 |
StandardMutableNetwork |  | 0% |  | 0% | 26 | 26 | 64 | 64 | 8 | 8 | 1 | 1 |
AbstractBaseGraph |  | 0% |  | 0% | 33 | 33 | 38 | 38 | 18 | 18 | 1 | 1 |
StandardNetwork |  | 0% |  | 0% | 26 | 26 | 50 | 50 | 21 | 21 | 1 | 1 |
StandardValueGraph |  | 0% |  | 0% | 27 | 27 | 45 | 45 | 19 | 19 | 1 | 1 |
DirectedMultiNetworkConnections |  | 0% |  | 0% | 20 | 20 | 39 | 39 | 13 | 13 | 1 | 1 |
ImmutableNetwork |  | 0% |  | 0% | 19 | 19 | 33 | 33 | 13 | 13 | 1 | 1 |
ElementOrder |  | 0% |  | 0% | 25 | 25 | 31 | 31 | 13 | 13 | 1 | 1 |
IncidentEdgeSet |  | 0% |  | 0% | 18 | 18 | 27 | 27 | 4 | 4 | 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 |
UndirectedMultiNetworkConnections |  | 0% |  | 0% | 17 | 17 | 28 | 28 | 11 | 11 | 1 | 1 |
NetworkBuilder |  | 0% | | n/a | 13 | 13 | 30 | 30 | 13 | 13 | 1 | 1 |
Traverser |  | 0% |  | 0% | 13 | 13 | 23 | 23 | 10 | 10 | 1 | 1 |
Graphs.TransposedNetwork |  | 0% | | n/a | 17 | 17 | 20 | 20 | 17 | 17 | 1 | 1 |
AbstractValueGraph |  | 0% |  | 0% | 14 | 14 | 21 | 21 | 9 | 9 | 1 | 1 |
EndpointPair |  | 0% |  | 0% | 13 | 13 | 16 | 16 | 9 | 9 | 1 | 1 |
MapIteratorCache |  | 0% |  | 0% | 15 | 15 | 28 | 28 | 10 | 10 | 1 | 1 |
UndirectedGraphConnections |  | 0% |  | 0% | 15 | 15 | 21 | 21 | 13 | 13 | 1 | 1 |
ForwardingValueGraph |  | 0% | | n/a | 19 | 19 | 19 | 19 | 19 | 19 | 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 |
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 |
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 |
AbstractValueGraph.new AbstractGraph() {...} |  | 0% | | n/a | 13 | 13 | 13 | 13 | 13 | 13 | 1 | 1 |
AbstractNetwork.1.new AbstractSet() {...} |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 5 | 5 | 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 |
InvalidatableSet |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 5 | 5 | 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 |
Traverser.Traversal.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 9 | 9 | 2 | 2 | 1 | 1 |
DirectedNetworkConnections |  | 0% | | n/a | 6 | 6 | 9 | 9 | 6 | 6 | 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 |
ElementOrder.Type |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 | 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 |
DirectedGraphConnections.1.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
ImmutableGraph.Builder |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
ImmutableNetwork.Builder |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 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 |
UndirectedNetworkConnections |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
MultiEdgesConnecting |  | 0% | | n/a | 3 | 3 | 7 | 7 | 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 |
Graphs.TransposedGraph.new IncidentEdgeSet() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 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 |
Graphs.NodeVisitState |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
EndpointPairIterator.Directed |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 2 | 2 | 1 | 1 |
Traverser.InsertionOrder |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
DirectedGraphConnections.NodeConnection.Succ |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
DirectedGraphConnections.NodeConnection.Pred |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
AbstractNetwork.new Predicate() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 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 |
UndirectedMultiNetworkConnections.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 |
Traverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Traverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Traverser.new Iterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
GraphConstants.Presence |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 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 |
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 |
GraphsBridgeMethods |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 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 |