Source file "com/google/common/graph/TraverserTest.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 3,519 of 3,519 | 0% | 6 of 6 | 0% | 138 | 138 | 589 | 589 | 135 | 135 |
| static {...} | | 0% | n/a | 1 | 1 | 18 | 18 | 1 | 1 | |
| forTree_depthFirstPostOrder_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_breadthFirstIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPostOrder_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_breadthFirstIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_breadthFirst_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPreOrder_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_breadthFirst_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_depthFirstPreOrder_iterableIsLazy() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forTree_breadthFirst_infinite() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| createGraph(boolean, String[]) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| forGraph_breadthFirst_infinite() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPreOrder_infinite() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_depthFirstPreOrder_infinite() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_breadthFirstIterable_diamond() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_diamond() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_diamond() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| forGraph_breadthFirst_diamond() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirst_multiGraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirstIterable_multiGraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirst_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirstIterable_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirst_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirstIterable_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrder_diamond() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrder_multigraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_multigraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrder_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrder_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrder_diamond() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrder_multigraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_multigraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrder_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_cycle() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrder_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_twoCycles() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forTree_breadthFirstIterable_tree() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forTree_depthFirstPreOrderIterableIterable_tree() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_tree() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| forGraph_breadthFirst_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_breadthFirstIterable_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_depthFirstPreOrder_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_depthFirstPostOrder_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirst_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirst_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirstIterable_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirst_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirstIterable_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPreOrder_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPreOrder_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPostOrder_tree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPostOrder_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_cyclicGraphContainingTree() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPostOrder_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_graphContainingTreeAndDiamond() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_withUndirectedValueGraph_throws() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_withUndirectedNetwork_throws() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_breadthFirstIterable_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_twoTrees() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_twoTrees() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_breadthFirstIterable_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_twoTrees() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_twoTrees() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_breadthFirstIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_withUndirectedGraph_throws() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_acceptsDirectedValueGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_acceptsDirectedNetwork() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_breadthFirstIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_emptyGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_breadthFirst_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_breadthFirstIterable_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPreOrder_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forGraph_depthFirstPostOrder_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_javadocExample_canBeIteratedMultipleTimes() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| forTree_acceptsDirectedGraph() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| createSingleRootGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_breadthFirst_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_breadthFirst_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_breadthFirstIterable_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPreOrder_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPreOrder_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPreOrderIterable_singleRoot() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forGraph_depthFirstPostOrder_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPostOrder_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forGraph_depthFirstPostOrderIterable_singleRoot() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_breadthFirst_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_breadthFirst_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_breadthFirstIterable_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPreOrder_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPreOrder_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPreOrderIterable_singleRoot() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| forTree_depthFirstPostOrder_twoTrees() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPostOrder_singleRoot() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| forTree_depthFirstPostOrderIterable_singleRoot() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| assertEqualCharNodes(Iterable, String) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| lambda$forTree_depthFirstPostOrderIterable_emptyGraph$14() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_depthFirstPostOrder_emptyGraph$13() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_depthFirstPreOrderIterable_emptyGraph$12() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_depthFirstPreOrder_emptyGraph$11() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_breadthFirstIterable_emptyGraph$10() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_breadthFirst_emptyGraph$9() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_depthFirstPostOrderIterable_emptyGraph$5() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_depthFirstPostOrder_emptyGraph$4() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_depthFirstPreOrderIterable_emptyGraph$3() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_depthFirstPreOrder_emptyGraph$2() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_breadthFirstIterable_emptyGraph$1() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forGraph_breadthFirst_emptyGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| forGraph_breadthFirst_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| forGraph_depthFirstPreOrder_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| forGraph_depthFirstPostOrder_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| forTree_breadthFirst_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| forTree_depthFirstPreOrder_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| forTree_depthFirstPostOrder_emptyGraph() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| fixedSuccessors(Iterable) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| createDirectedGraph(String[]) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| createUndirectedGraph(String[]) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_withUndirectedNetwork_throws$8(MutableNetwork) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_withUndirectedValueGraph_throws$7(MutableValueGraph) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$forTree_withUndirectedGraph_throws$6(MutableGraph) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| TraverserTest() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |