Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
Total | 118 of 118 | 0% | 20 of 20 | 0% | 19 | 19 | 30 | 30 | 9 | 9 |
accept(RoutingCHEdgeIterator, int, boolean) | ![]() | 0% | ![]() | 0% | 8 | 8 | 6 | 6 | 1 | 1 |
AbstractManyToManyRoutingAlgorithm(RoutingCHGraph, Weighting, TraversalMode) | ![]() | 0% | n/a | 1 | 1 | 10 | 10 | 1 | 1 | |
getIncEdge(RoutingCHEdgeIteratorState, boolean) | ![]() | 0% | ![]() | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
isMaxVisitedNodesExceeded() | ![]() | 0% | ![]() | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
toString() | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
setEdgeFilter(CHEdgeFilter) | ![]() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
setMaxVisitedNodes(int) | ![]() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
getName() | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
setInfiniteUTurnCost(boolean) | ![]() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 |