| checkAllPathsWithoutBackEdges(DiGraph.DiGraphNode, DiGraph.DiGraphNode) |  | 0% | | 0% | 11 | 11 | 17 | 17 | 1 | 1 |
| checkSomePathsWithoutBackEdges(DiGraph.DiGraphNode, DiGraph.DiGraphNode) | | 0% | | 0% | 11 | 11 | 17 | 17 | 1 | 1 |
| discoverBackEdges(DiGraph.DiGraphNode) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| CheckPathsBetweenNodes(DiGraph, DiGraph.DiGraphNode, DiGraph.DiGraphNode, Predicate, Predicate, boolean) | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| allPathsSatisfyPredicate() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| somePathsSatisfyPredicate() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| setUp() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| CheckPathsBetweenNodes(DiGraph, DiGraph.DiGraphNode, DiGraph.DiGraphNode, Predicate, Predicate) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| ignoreEdge(DiGraph.DiGraphEdge) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| tearDown() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |