dijkstra - Dijkstras Algorithm for Shortest Paths Thanks to...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Dijkstra’s Algorithm for Shortest Paths Thanks to Jim Orlin and MIT OCW
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 An Example 2 3 4 5 6 2 4 2 1 3 4 2 3 2 Initialize 1 0 Select the node with the minimum temporary distance label.
Background image of page 2
3 Update Step 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Choose Minimum Temporary Label 1 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 2
Background image of page 4
5 Update Step 1 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 6 4 3 0 The predecessor of node 3 is now node 2
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Choose Minimum Temporary Label 1 2 4 5 6 2 4 2 1 3 4 2 3 2 2 3 6 4 0 3
Background image of page 6
7 Update 1 2 4 5 6 2 4 2 1 3 4 2 3 2 0 d(5) is not changed. 3 2 3 6 4
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Choose Minimum Temporary Label 1 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5
Background image of page 8
9 Update 1 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 d(4) is not changed 6
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10 Choose Minimum Temporary Label 1 2 6 2 4 2 1 3
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/26/2011 for the course IEOR 4004 taught by Professor Sethuraman during the Fall '10 term at Columbia.

Page1 / 13

dijkstra - Dijkstras Algorithm for Shortest Paths Thanks to...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online