Download presentation

Presentation is loading. Please wait.

Published byMichelle Carney Modified over 2 years ago

1
and 6.855J Dijkstras Algorithm with simple buckets (also known as Dials algorithm)

2
2 An Example Initialize distance labels 1 0 Select the node with the minimum temporary distance label Initialize buckets.

3
3 Update Step

4
4 Choose Minimum Temporary Label Find Min by starting at the leftmost bucket and scanning right till there is a non-empty bucket.

5
5 Update Step

6
6 Choose Minimum Temporary Label Find Min by starting at the leftmost bucket and scanning right till there is a non-empty bucket.

7
7 Update

8
8 Choose Minimum Temporary Label

9
9 Update

10
10 Choose Minimum Temporary Label

11
11 Update

12
12 Choose Minimum Temporary Label There is nothing to update

13
13 End of Algorithm 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

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google