From bf48c87dacc072239e7aa0a04a7ee4c1397df564 Mon Sep 17 00:00:00 2001 From: Rajat Asthana Date: Sat, 8 Sep 2018 02:58:50 +0530 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index da7e3f2..c59ec68 100644 --- a/README.md +++ b/README.md @@ -2,7 +2,7 @@ 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** +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 Algorithm to solve the problem?** > *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 average. So, we need something significantly faster.