Embed Size (px)
DESCRIPTION
Graph Primitives. Dijkstra’s Algorithm: The Basics. Design and Analysis of Algorithms I. Single-Source Shortest Paths. One of the following is the list of shortest-path distances for the nodes , respectively. Which is it?. 0,1,2,3. 0,1,4,7. 0,1,3,6. Why Another Shortest-Path Algorithm?. - PowerPoint PPT Presentation
Citation preview
Graph Primitives
Dijkstra’s Algorithm: The Basics
Design and Analysis of Algorithms I
Tim Roughgarden
Single-Source Shortest Paths
0,1,2,3
0,1,4,7
0,1,4,60,1,3,6
One of the following is the list of shortest-path distances for the nodes , respectively. Which is it?
Tim Roughgarden
Why Another Shortest-Path Algorithm?
Tim Roughgarden
Dijkstra’s Algorithm
Tim Roughgarden
Example
Tim Roughgarden
Non-Example
