findAndHandleShortcuts(int, CoreNodeContractor.PrepareShortcutHandler) |  | 0% |  | 0% | 9 | 9 | 33 | 33 | 1 | 1 |
insertInShortcuts(int) |  | 0% |  | 0% | 10 | 10 | 22 | 22 | 1 | 1 |
insertShortcuts(int, boolean) |  | 0% |  | 0% | 5 | 5 | 16 | 16 | 1 | 1 |
addOrUpdateShortcut(int, int, double, int, int, int, int, int) |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 1 | 1 |
insertOutShortcuts(int) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
calculatePriority(int) |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
CoreNodeContractor(CorePreparationGraph, CHStorageBuilder, PMap) |  | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
contractNode(int) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
getStatisticsString() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
initFromGraph() |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
close() |  | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
extractParams(PMap) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
countShortcuts(int, int, double, int, int, int, int, int) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
prepareContraction() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
finishContraction() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
getMaxVisitedNodesEstimate() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getAddedShortcutsCount() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getDijkstraSeconds() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getDijkstraCount() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |