DIJKSTRA (G, w, s)
{
  INITIALIZE SINGLE-SOURCE (G, s)
  S ← { }     // finalized shortest paths
  PQ ← V[G]   // priority queue keyed by distance

  while PQ not empty:
    u ← EXTRACT-MIN(PQ)
    for each v in Adj[u]:
      Relax(u, v, w)
}
            

Time Complexity:
  O((V + E) log V)
Space: O(V + E)