| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 86 of 86 | 0% | 6 of 6 | 0% | 11 | 11 | 19 | 19 | 8 | 8 |
| AbstractOneToManyRoutingAlgorithm(Graph, Weighting, TraversalMode) | | 0% | n/a | 1 | 1 | 10 | 10 | 1 | 1 | |
| accept(EdgeIterator, int) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| isMaxVisitedNodesExceeded() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| createSPTEntry(int, double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| toString() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| setEdgeFilter(EdgeFilter) | | 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 |