{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

dijkstrasalgorithm - 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4...

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

View Full Document Right Arrow Icon
15.082 and 6.855J Dijkstra’s Algorithm
Background image of page 1

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

View Full Document Right 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 Document Right 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 Document Right 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 Document Right Arrow Icon
8 Choose Minimum Temporary Label 1
Background image of page 8
Background image of page 9

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

View Full Document Right Arrow Icon
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 Document Right 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.

Unformatted text preview: 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 ∞ 5 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 10 Choose Minimum Temporary Label 1 2 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 11 Update 1 2 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 d(6) is not updated 12 Choose Minimum Temporary Label 1 2 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 6 There is nothing to update 13 End of Algorithm 1 2 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 6 All nodes are now permanent The predecessors form a tree The shortest path from node 1 to node 6 can be found by tracing back predecessors...
View Full Document

{[ snackBarMessage ]}