| iterateMultiTree(RoutingCHEdgeIterator, AveragedMultiTreeSPEntry) |  | 0% | | 0% | 9 | 9 | 27 | 27 | 1 | 1 |
| updateTarget(AveragedMultiTreeSPEntry) | | 0% | | 0% | 6 | 6 | 24 | 24 | 1 | 1 |
| iterateMultiTreeDownwards(AveragedMultiTreeSPEntry, RoutingCHEdgeIterator, AveragedMultiTreeSPEntry) | | 0% | | 0% | 7 | 7 | 25 | 25 | 1 | 1 |
| runAlgo() | | 0% | | 0% | 10 | 10 | 21 | 21 | 1 | 1 |
| exploreEntryDownwards(RoutingCHEdgeIterator) | | 0% | | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
| handleMultiEdgeCase(RoutingCHEdgeIterator) | | 0% | | 0% | 5 | 5 | 16 | 16 | 1 | 1 |
| handleSingleEdgeCase(RoutingCHEdgeIterator) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| calcPaths(int[], int[]) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| DijkstraManyToMany(RoutingCHGraph, Weighting, TraversalMode) | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| createEntriesList(RoutingCHEdgeIterator) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| prepare(int[], int[]) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getEdgeEntry(RoutingCHEdgeIterator, List) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| initBestWeightMapEntryList(IntObjectMap, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| addEntriesFromMapToQueue() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| exploreEntry(RoutingCHEdgeIterator) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| calcWeight(RoutingCHEdgeIteratorState, boolean, int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getTurnWeight(int, int, int, boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| updateEntryInQueue(AveragedMultiTreeSPEntry, boolean) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| createEmptyEntry(RoutingCHEdgeIterator) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| initCollections(int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| DijkstraManyToMany(RoutingCHGraph, IntObjectMap, IntObjectMap, Weighting, TraversalMode) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| calcPathWeight(RoutingCHEdgeIteratorState, SPTEntry, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| finishedDownwards() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| reset() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| setTargetGraphExplorer(RoutingCHEdgeExplorer) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setTargetMap(IntObjectMap) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setTargetSet(IntHashSet) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setHasTurnWeighting(boolean) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setTreeEntrySize(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setSwap(boolean) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setVisitedNodes(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setMaxVisitedNodes(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| considerTurnRestrictions(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getVisitedNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getName() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| calcTime(RoutingCHEdgeIteratorState, SPTEntry, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |