Source file "com/google/common/graph/AbstractNetworkTest.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,323 of 2,323 | 0% | 69 of 69 | 0% | 100 | 100 | 440 | 440 | 65 | 65 |
| validateNetwork(Network) | | 0% | | 0% | 32 | 32 | 141 | 141 | 1 | 1 |
| queryAccessorSetAfterElementRemoval() | | 0% | n/a | 1 | 1 | 40 | 40 | 1 | 1 | |
| removeNode_existingNode() | | 0% | n/a | 1 | 1 | 29 | 29 | 1 | 1 | |
| removeEdge_parallelSelfLoopEdge() | | 0% | n/a | 1 | 1 | 13 | 13 | 1 | 1 | |
| edgesConnecting_parallelEdges_undirected() | | 0% | n/a | 1 | 1 | 8 | 8 | 1 | 1 | |
| concurrentIteration() | | 0% | | 0% | 3 | 3 | 15 | 15 | 1 | 1 |
| removeEdge_oneOfMany() | | 0% | n/a | 1 | 1 | 8 | 8 | 1 | 1 | |
| edgesConnecting_parallelEdges_directed() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| adjacentEdges_parallelEdges() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| removeEdge_parallelEdge() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| edgesConnecting_parallelSelfLoopEdges() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| removeEdge_existingEdge() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| adjacentEdges_bothEndpoints() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| incidentEdges_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| adjacentNodes_oneEdge() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| hasEdgeConnecting_nodesNotInGraph() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| removeEdge_edgeNotPresent() | | 0% | n/a | 1 | 1 | 6 | 6 | 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_queryAfterRemoval() | | 0% | n/a | 1 | 1 | 8 | 8 | 1 | 1 | |
| incidentNodes_oneEdge() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| edgesConnecting_nodesNotInGraph() | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| addNode_newNode() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| static {...} | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| edges_oneEdge() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| edges_noEdges() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| adjacentEdges_noAdjacentEdges() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| nodes_oneNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| hasEdgeConnecting_disconnectedNodes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| init() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| edgesConnecting_disconnectedNodes() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| incidentEdges_isolatedNode() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| adjacentNodes_noAdjacentNodes() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| inEdges_noInEdges() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| outEdges_noOutEdges() | | 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 | |
| graphIsMutable() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$edgesConnecting_nodesNotInGraph$2() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$edgesConnecting_nodesNotInGraph$1() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| lambda$edgesConnecting_nodesNotInGraph$0() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| nodes_noNodes() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| incidentEdges_nodeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| incidentNodes_edgeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| adjacentNodes_nodeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| adjacentEdges_edgeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| inEdges_nodeNotInGraph() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| outEdges_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 | ||
| lambda$removeEdge_queryAfterRemoval$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$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$outEdges_nodeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$inEdges_nodeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$adjacentEdges_edgeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$adjacentNodes_nodeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$incidentNodes_edgeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| lambda$incidentEdges_nodeNotInGraph$0() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| validateNetworkState() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| AbstractNetworkTest() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |