Content deleted Content added
m Undid revision 1300346054 by Idozur03 (talk) Original algorithm was correct to return the vertex u with minimum dist[u] |
|||
Line 49:
8
9 '''while''' ''Q'' is not empty:
10 ''u'' ← vertex in ''Q'' with minimum dist[
11 Q.remove(u)
12
| |||