Hi, Which bi-directional algorithm should I use for CHs, Dijkstra or AStar? Are there use specific (dis)advantages? Or is AStar always faster than Dijkstra?
(See https://github.com/graphhopper/graphhopper/blob/master/core/src/main/java/com/graphhopper/routing/ch/PrepareContractionHierarchies.java#L815) Jan
_______________________________________________ GraphHopper mailing list [email protected] https://lists.openstreetmap.org/listinfo/graphhopper
