• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Dijkstra's Algorithm  - Colleen Young
 

Dijkstra's Algorithm - Colleen Young

on

  • 2,780 views

Find the shortest path in a network

Find the shortest path in a network

Statistics

Views

Total Views
2,780
Views on SlideShare
392
Embed Views
2,388

Actions

Likes
0
Downloads
17
Comments
0

3 Embeds 2,388

http://colleenyoung.wordpress.com 2385
http://translate.googleusercontent.com 2
http://localhost 1

Accessibility

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

CC Attribution License

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Dijkstra's Algorithm  - Colleen Young Dijkstra's Algorithm - Colleen Young Presentation Transcript

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