Dijkstra Algorithm : PPT

DIJKSTRA (G, w, s)

1. INITIALIZE SINGLE-SOURCE (G, s)
2. S ← { }     // S will ultimately contains vertices of final shortest-path weights from s
3. Initialize priority queue Q i.e., Q  ←  V[G]
4. while priority queue Q  is not empty do
5. u  ←  EXTRACT_MIN(Q)    // Pull out new vertex
6.     S  ←  S È {u}
       // Perform relaxation for each vertex v adjacent to u
7.     for each vertex v in Adj[u] do
8.         Relax (u, v, w)

Above is the algorithm for dijkstra’s minimum path. Click below for more…