| calcPaths(int[], int[]) |  | 0% | | 0% | 8 | 8 | 34 | 34 | 1 | 1 |
| fillEdgesUpward(MultiTreeSPEntry, PriorityQueue, IntObjectMap, RoutingCHEdgeExplorer) | | 0% | | 0% | 12 | 12 | 35 | 35 | 1 | 1 |
| fillEdgesDownward(MultiTreeSPEntry, PriorityQueue, IntObjectMap, RoutingCHEdgeExplorer) | | 0% | | 0% | 10 | 10 | 36 | 36 | 1 | 1 |
| prepare(int[], int[]) | | 0% | | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| RPHASTAlgorithm(RoutingCHGraph, Weighting, TraversalMode) | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| upwardSearch() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| addNodes(SubGraph, PriorityQueue, int[]) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| downwardSearch() | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| runUpwardSearch() | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| runDownwardSearch() | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| initCollections(int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| reset() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getVisitedNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |