Source file "com/google/common/graph/AbstractStandardUndirectedGraphTest.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,409 of 1,409 | 0% | 2 of 2 | 0% | 45 | 45 | 228 | 228 | 44 | 44 |
| putEdge_nodesNotInGraph() | | 0% | n/a | 1 | 1 | 12 | 12 | 1 | 1 | |
| stableIncidentEdgeOrder_incidentEdges_withSelfLoop_returnsInEdgeInsertionOrder() | | 0% | n/a | 1 | 1 | 12 | 12 | 1 | 1 | |
| incidentEdges_selfLoop() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| stableIncidentEdgeOrder_edges_returnsInStableOrder() | | 0% | n/a | 1 | 1 | 10 | 10 | 1 | 1 | |
| predecessors_selfLoop() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| successors_selfLoop() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| stableIncidentEdgeOrder_incidentEdges_returnsInEdgeInsertionOrder() | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| removeEdge_existingSelfLoopEdge() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| validateUndirectedEdges() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| removeEdge_antiparallelEdges() | | 0% | n/a | 1 | 1 | 8 | 8 | 1 | 1 | |
| stableIncidentEdgeOrder_adjacentNodes_returnsInConnectingEdgeInsertionOrder() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| stableIncidentEdgeOrder_predecessors_returnsInConnectingEdgeInsertionOrder() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| stableIncidentEdgeOrder_successors_returnsInConnectingEdgeInsertionOrder() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| incidentEdges_oneEdge() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| putEdge_allowsSelfLoops() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| degree_selfLoop() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| inDegree_selfLoop() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| outDegree_selfLoop() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| adjacentNodes_selfLoop() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| removeNode_existingNodeWithSelfLoopEdge() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| adjacentNodes_checkReturnedSetMutability() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| predecessors_checkReturnedSetMutability() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| successors_checkReturnedSetMutability() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| incidentEdges_checkReturnedSetMutability() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| predecessors_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| successors_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| populateTShapedGraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| hasEdgeConnecting_missingNode() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| nodes_checkReturnedSetMutability() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| putEdge_existingSelfLoopEdgeBetweenSameNodes() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| putEdge_doesntAllowSelfLoops() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| inDegree_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| outDegree_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| hasEdgeConnecting_correct() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| hasEdgeConnecting_mismatch() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| putEdge_existingNodes() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| putEdge_existingEdgeBetweenSameNodes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| lambda$incidentEdges_checkReturnedSetMutability$0(Set) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$putEdge_doesntAllowSelfLoops$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$successors_checkReturnedSetMutability$0(Set) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$predecessors_checkReturnedSetMutability$0(Set) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$adjacentNodes_checkReturnedSetMutability$0(Set) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$nodes_checkReturnedSetMutability$0(Set) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| AbstractStandardUndirectedGraphTest() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |