| AbstractCoreRoutingAlgorithm(RoutingCHGraph, Weighting) |  | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| accept(RoutingCHEdgeIteratorState, CHEntry, boolean) | | 0% | | 0% | 7 | 7 | 5 | 5 | 1 | 1 |
| calcWeight(RoutingCHEdgeIteratorState, boolean, int, long) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| runPhase1() | | 0% | | 0% | 7 | 7 | 6 | 6 | 1 | 1 |
| runAlgo() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| calcTime(RoutingCHEdgeIteratorState, boolean, long) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| extractPath() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| updateBestPath(SPTEntry, SPTEntry, double, boolean) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| calcPath(int, int, long) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getTurnWeight(int, int, int, boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| isCoreNode(int) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| getIncEdge(RoutingCHEdgeIteratorState, boolean) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| considerTurnRestrictions(int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| createCHEntry(int, double, long) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| calcEdgeWeight(RoutingCHEdgeIteratorState, SPTEntry, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isTurnRestrictedNode(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isVirtualNode(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getEdgeIteratorState(RoutingCHEdgeIteratorState) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| createEmptyPath() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| calcPath(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getVisitedNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getVisitedNodesPhase1() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getVisitedNodesPhase2() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setEdgeFilter(CoreDijkstraFilter) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| finished() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| calcEdgeTime(RoutingCHEdgeIteratorState, SPTEntry, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| initPhase2() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |