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