LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
48Updated last year

Alternatives and similar repositories for ch:

Users that are interested in ch are comparing it to the libraries listed below