dialsalgorithm

# dialsalgorithm - 15.082 and 6.855J Dijkstras Algorithm with...

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

1 15.082 and 6.855J Dijkstra’s Algorithm with simple buckets (also known as Dial’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 distance labels 1 0 Select the node with the minimum temporary distance label. 0 1 2 3 4 5 6 7 1 2 3 4 5 6 Initialize buckets.
3 Update Step 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 1 0 1 2 3 4 5 6 7 1 2 3 4 5 6 2 3

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 0 1 2 3 4 5 6 7 4 5 6 2 3 Find Min by starting at the leftmost bucket and scanning right till there is a non-empty bucket.
5 Update Step 1 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 6 4 3 0 0 1 2 3 4 5 6 7 4 5 6 2 3 3 4 5

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 0 1 2 3 4 5 6 7 6 3 4 5 Find Min by starting at the leftmost bucket and scanning right till there is a non-empty bucket.
7 Update 1 2 4 5 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 0 1 2 3 4 5 6 7 6 3 4 5

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 0 1 2 3 4 5 6 7 6 4 5
9 Update 1 2 4 6 2 4 2 1 3 4 2 3

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

View Full Document

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.

## This note was uploaded on 03/15/2010 for the course IE 505 taught by Professor Yok during the Spring '10 term at Galatasaray Üniversitesi.

### Page1 / 13

dialsalgorithm - 15.082 and 6.855J Dijkstras Algorithm with...

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

View Full Document
Ask a homework question - tutors are online