We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.