Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods | Missed | Classes |
Total | 1,705 of 1,705 | 0% | 190 of 190 | 0% | 174 | 174 | 398 | 398 | 79 | 79 | 10 | 10 |
RPHASTAlgorithm | ![]() | 0% | ![]() | 0% | 55 | 55 | 163 | 163 | 13 | 13 | 1 | 1 |
DijkstraOneToManyAlgorithm | ![]() | 0% | ![]() | 0% | 33 | 33 | 85 | 85 | 12 | 12 | 1 | 1 |
SubGraph | ![]() | 0% | ![]() | 0% | 14 | 14 | 36 | 36 | 6 | 6 | 1 | 1 |
AbstractManyToManyRoutingAlgorithm | ![]() | 0% | ![]() | 0% | 19 | 19 | 30 | 30 | 9 | 9 | 1 | 1 |
SubGraph.EdgeIteratorLinkIterator | ![]() | 0% | ![]() | 0% | 17 | 17 | 28 | 28 | 14 | 14 | 1 | 1 |
AbstractOneToManyRoutingAlgorithm | ![]() | 0% | ![]() | 0% | 11 | 11 | 19 | 19 | 8 | 8 | 1 | 1 |
DijkstraCostCondition | ![]() | 0% | ![]() | 0% | 9 | 9 | 12 | 12 | 5 | 5 | 1 | 1 |
TDDijkstraCostCondition | ![]() | 0% | ![]() | 0% | 9 | 9 | 12 | 12 | 5 | 5 | 1 | 1 |
SubGraph.EdgeIteratorLink | ![]() | 0% | n/a | 5 | 5 | 9 | 9 | 5 | 5 | 1 | 1 | |
SubGraph.SubGraphEdgeExplorer | ![]() | 0% | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |