Dijkstra's algorithm: Difference between revisions

Revision as of 15:52, 24 March 2002

Revision as of 11:11, 14 April 2002

Line 42:

1 S = empty sequence

2 u := t

3 S = Su + S /* insert u to the beginning of S */

4 '''if''' u == s

5 end

Line 48:

7 goto 3

Now sequence S has the shortest path from s to t.

Then read the sequence S in reverse order.