Bi-Directional Dijkstra Problem Given a graph with non-negative edge weights, a source vertex S and a target vertec T. Find the shortest path between S and T But why don't we just use Dijkstra's ...

0 (E + VlogV) is the worst case time complexity of the Dijkstra's Algorithm which is pretty fast. But, for a graph with 20million vertices and 50million edges, it will work for several seconds on ...