Source file "com/google/common/graph/AbstractGraphTest.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,248 of 1,248 | 0% | 26 of 26 | 0% | 60 | 60 | 236 | 236 | 47 | 47 |
| validateGraph(Graph) | | 0% | | 0% | 12 | 12 | 59 | 59 | 1 | 1 |
| removeNode_existingNode() | | 0% | n/a | 1 | 1 | 23 | 23 | 1 | 1 | |
| queryAccessorSetAfterElementRemoval() | | 0% | n/a | 1 | 1 | 25 | 25 | 1 | 1 | |
| removeEdge_existingEdge() | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| removeNode_antiparallelEdges() | | 0% | n/a | 1 | 1 | 10 | 10 | 1 | 1 | |
| removeEdge_oneOfMany() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| adjacentNodes_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| addNode_existingNode() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| removeNode_nodeNotPresent() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| removeEdge_edgeNotPresent() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| queryGraphAfterElementRemoval() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| removeEdge_nodeNotPresent() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| degree_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| addNode_newNode() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| static {...} | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| nodes_oneNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| init() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| degree_isolatedNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| inDegree_isolatedNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| outDegree_isolatedNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| adjacentNodes_noAdjacentNodes() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| predecessors_noPredecessors() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| successors_noSuccessors() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| incidentEdges_noIncidentEdges() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| graphIsMutable() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| nodes_noNodes() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| adjacentNodes_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| predecessors_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| successors_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| incidentEdges_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| degree_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| inDegree_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| outDegree_nodeNotInGraph() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| lambda$queryGraphAfterElementRemoval$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$removeNode_existingNode$3() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$removeNode_existingNode$2() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$removeNode_existingNode$1() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$removeNode_existingNode$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$outDegree_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$inDegree_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$degree_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$incidentEdges_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$successors_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$predecessors_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$adjacentNodes_nodeNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| validateGraphState() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| AbstractGraphTest() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |