Dijkstra's algorithm: Difference between revisions

Content deleted Content added
Tag: Reverted
Tag: Reverted
Line 89:
12
13
14 '''while''' ''Q'' is not empty: mmmmm,.,.,.,..,.,...,, ''// The main loop''
15 ''u'' ← ''Q''.extract_min() m ''// Remove and return best vertex''
16 '''for each''' neighbor ''v'' of ''u'': ''// Go through all v neighbors of u''