Source file "com/google/common/graph/Graphs.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 718 of 718 | 0% | 105 of 105 | 0% | 75 | 75 | 163 | 163 | 22 | 22 |
| subgraphHasCycle(Graph, Map, Object) | | 0% | | 0% | 8 | 8 | 26 | 26 | 1 | 1 |
| inducedSubgraph(Network, Iterable) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| inducedSubgraph(ValueGraph, Iterable) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| inducedSubgraph(Graph, Iterable) | | 0% | | 0% | 6 | 6 | 13 | 13 | 1 | 1 |
| copyOf(ValueGraph) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| copyOf(Network) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| copyOf(Graph) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| hasCycle(Graph) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| transitiveClosure(Graph, Graphs.TransitiveClosureSelfLoopStrategy) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| getReachableNodes(Graph, Object, Graphs.TransitiveClosureSelfLoopStrategy) | | 0% | | 0% | 3 | 3 | 5 | 5 | 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 |
| transitiveClosure(Graph) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |