| populate(Map, List) |  | 0% | | 0% | 10 | 10 | 25 | 25 | 1 | 1 |
| next() | | 0% | | 0% | 7 | 7 | 22 | 22 | 1 | 1 |
| TopologicalOrderIterator(DirectedGraph, HepMatchOrder) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| findCycles() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lambda$populate$3(DefaultEdge) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$populate$2(DefaultEdge) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$next$6(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$next$5(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$next$4(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| hasNext() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$of$1(DirectedGraph, HepMatchOrder) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| TopologicalOrderIterator(DirectedGraph) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$of$0(DirectedGraph) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| of(DirectedGraph, HepMatchOrder) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| of(DirectedGraph) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |