| transitiveClosure(Graph) |  | 0% | | 0% | 8 | 8 | 16 | 16 | 1 | 1 |
| inducedSubgraph(Network, Iterable) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| inducedSubgraph(ValueGraph, Iterable) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| inducedSubgraph(Graph, Iterable) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| copyOf(Network) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| subgraphHasCycle(Graph, Map, Object, Object) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| copyOf(ValueGraph) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| hasCycle(Graph) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| copyOf(Graph) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| hasCycle(Network) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| transpose(Graph) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| transpose(ValueGraph) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| transpose(Network) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| reachableNodes(Graph, Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| checkNonNegative(long) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| checkPositive(long) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| canTraverseWithoutReusingEdge(Graph, Object, Object) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| transpose(EndpointPair) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| checkNonNegative(int) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| checkPositive(int) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |