Source file "com/google/common/graph/GraphsTest.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,889 of 1,889 | 0% | 8 of 8 | 0% | 55 | 55 | 381 | 381 | 51 | 51 |
| transpose_directedNetwork() | 0% | 0% | 2 | 2 | 31 | 31 | 1 | 1 | ||
| transpose_directedValueGraph() | 0% | 0% | 2 | 2 | 25 | 25 | 1 | 1 | ||
| transpose_directedGraph() | 0% | 0% | 2 | 2 | 25 | 25 | 1 | 1 | ||
| transitiveClosure_directedCycleGraph() | 0% | n/a | 1 | 1 | 24 | 24 | 1 | 1 | ||
| transitiveClosure_undirectedCycleGraph() | 0% | n/a | 1 | 1 | 18 | 18 | 1 | 1 | ||
| transitiveClosure_directedPathGraph() | 0% | n/a | 1 | 1 | 17 | 17 | 1 | 1 | ||
| transitiveClosure_undirectedPathGraph() | 0% | n/a | 1 | 1 | 17 | 17 | 1 | 1 | ||
| inducedSubgraph_valueGraph() | 0% | n/a | 1 | 1 | 13 | 13 | 1 | 1 | ||
| inducedSubgraph_network() | 0% | n/a | 1 | 1 | 13 | 13 | 1 | 1 | ||
| createUndirected() | 0% | n/a | 1 | 1 | 14 | 14 | 1 | 1 | ||
| transitiveClosure_directedGraph() | 0% | n/a | 1 | 1 | 15 | 15 | 1 | 1 | ||
| transitiveClosure_undirectedGraph() | 0% | n/a | 1 | 1 | 15 | 15 | 1 | 1 | ||
| inducedSubgraph_graph() | 0% | n/a | 1 | 1 | 13 | 13 | 1 | 1 | ||
| createDirected() | 0% | n/a | 1 | 1 | 12 | 12 | 1 | 1 | ||
| createUndirected_multigraph() | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | ||
| buildDirectedNetwork() | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | ||
| buildUndirectedNetwork() | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | ||
| createDirected_multigraph() | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | ||
| createUndirected_expectedNodeCount() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| createUndirected_expectedEdgeCount() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| createDirected_expectedNodeCount() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| createDirected_expectedEdgeCount() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| checkTransitiveClosure(Graph, Graph) | 0% | 0% | 2 | 2 | 5 | 5 | 1 | 1 | ||
| buildDirectedValueGraph() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| buildUndirectedValueGraph() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| buildDirectedGraph() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| buildUndirectedGraph() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| transpose_undirectedValueGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| transpose_undirectedNetwork() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| transpose_undirectedGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| static {...} | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| builder_expectedNodeCount_negative() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| builder_expectedEdgeCount_negative() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_directedGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_undirectedGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_directedValueGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_undirectedValueGraph() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_directedNetwork() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| copyOf_undirectedNetwork() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| inducedSubgraph_nodeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| lambda$createUndirected$6(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$createUndirected$5(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$createUndirected$4(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$createDirected$3(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$createDirected$2(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$inducedSubgraph_nodeNotInGraph$0(MutableNetwork) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| copyOf_nullArgument() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| lambda$builder_expectedEdgeCount_negative$8() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$builder_expectedNodeCount_negative$7() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$copyOf_nullArgument$1() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| GraphsTest() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |