| computeTreeFromGraph() |  | 0% | | 0% | 3 | 3 | 18 | 18 | 1 | 1 |
| assignZeroFlowTo(Line) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| lambda$exploreZ0$0(Bus, Set, Line) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| exploreZ0(Set) | | 0% | | 0% | 2 | 2 | 10 | 10 | 1 | 1 |
| lambda$computeTreeFromGraph$4(Bus, Set, List, Z0Edge) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| addToGraph(Line, Bus, Bus) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| lambda$computeTreeFromGraph$3(Map, Z0Edge) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| complete() | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| completeFlowsForEdgesInsideTree() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| valid() | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| Z0BusGroup(Bus, Z0LineChecker) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| addLoop(Line) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| lambda$completeFlowsForEdgesInsideTree$7(Bus) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| other(Line, Bus) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| assignZeroFlowToEdgesOutsideTree() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| lambda$assignZeroFlowToEdgesOutsideTree$6(Z0Edge) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lambda$computeTreeFromGraph$5(Map, Set, List, Bus) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| assignZeroFlowToLoops() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| contains(Bus) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$computeTreeFromGraph$2(Bus) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$computeTreeFromGraph$1(Bus) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |