Your SlideShare is downloading. ×
Dijkstra's Algorithm  - Colleen Young
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Dijkstra's Algorithm - Colleen Young

3,083

Published on

Find the shortest path in a network

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,083
On Slideshare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
305
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

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

×