LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
47Updated 11 months ago

Related projects

Alternatives and complementary repositories for ch