figure title

Author: NikitaSharma1

content/algorithms/Dijkstra/Dijkstra.md

@@ -83,7 +83,7 @@ According to Dijkstra's algorithm,
     - ZRH : `min(infinity, 5) = 5`
 
 
-![Figure 1&2](Graphs/figure1_2.png "Figure 1 and Figure 2")
+![Figure 1&2](Graphs/figure1_2.png "Step 1 and Step 2")
 
 
 - Now, pick the next unvisited node with the minimum distance value. ZRH has the minimum distance (5 units), so it's time to update its neighbour's (LCY, GVA) distance.(fig. 3)