{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

dijkstrasalgorithm

# dijkstrasalgorithm - 15.082 and 6.855J Dijkstras Algorithm...

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

1 15.082 and 6.855J Dijkstra’s Algorithm

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

View Full Document
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.
3 Update Step 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 1

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

View Full Document
4 Choose Minimum Temporary Label 1 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 2
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

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

View Full Document
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
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

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

View Full Document
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
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

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

View Full Document
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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

dijkstrasalgorithm - 15.082 and 6.855J Dijkstras Algorithm...

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

View Full Document
Ask a homework question - tutors are online