Dijkstra's Algorithm - Colleen Young

3,851 views

Published on

Find the shortest path in a network

Published in: Education, Business, Technology
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
3,851
On SlideShare
0
From Embeds
0
Number of Embeds
2,684
Actions
Shares
0
Downloads
327
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

Dijkstra's Algorithm - Colleen Young

  1. 1. Dijkstra’s Algorithm An algorithm for finding the shortest path between two vertices in a graph
  2. 2. Start vertex order label 1 distance label 0 temporary labels given to B, C, D
  3. 3. Shortest distances AB 4 ACFB AC 2 AC AD 3 AD AE 5 ACFBE AF 3 ACF AG 6 ACFBFG

×