Scribd
Upload
28 views16 pages

Dijkstras Algorithm

Dijkstra's algorithm is used to find the shortest paths between vertices in a graph. It works by maintaining distances from a source vertex to all other vertices. It iteratively selects the unvisited vertex with the shortest distance and updates distances through neighbors. The algorithm outputs the shortest path lengths or paths from the source to all other vertices. It is commonly used in applications like mapping, routing, and modeling disease spread through contact networks.

Uploaded by

mansur
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
28 views16 pages

Dijkstras Algorithm

Dijkstra's algorithm is used to find the shortest paths between vertices in a graph. It works by maintaining distances from a source vertex to all other vertices. It iteratively selects the unvisited vertex with the shortest distance and updates distances through neighbors. The algorithm outputs the shortest path lengths or paths from the source to all other vertices. It is commonly used in applications like mapping, routing, and modeling disease spread through contact networks.

Uploaded by

mansur
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1/ 16

Dijkstra's algorithm

Single-Source Shortest Path Problem


Single-Source Shortest Path Problem - The
problem of finding shortest paths from a source
vertex v to all other vertices in the graph.

Dijkstra's algorithm
Dijkstra's algorithm - is a solution to the singlesource shortest path problem in graph theory.
Works on both directed and undirected graphs.
However, all edges must have nonnegative weights.
Approach: Greedy
Input: Weighted graph G={E,V} and source vertex
vV, such that all edge weights are nonnegative
Output: Lengths of shortest paths (or the shortest
paths themselves) from a given source vertex vV
to all other vertices

Dijkstra's algorithm - Pseudocode


dist[s] 0
(distance to source vertex is zero)
for all v V{s}
do dist[v]
(set all other distances to infinity)
S
(S, the set of visited vertices is initially
empty)
QV
(Q, the queue initially contains all vertices)

while Q
(while the queue is not empty)
do u mindistance(Q,dist) (select the element of Q with the min.
distance)
SS{u}
(add u to list of visited vertices)
for all v neighbors[u]
do if dist[v] > dist[u] + w(u, v)
(if new shortest path
found)
then d[v] d[u] + w(u, v)
(set new value of
shortest path)
(if desired, add traceback code)
return dist

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Dijkstra Animated Example

Applications of Dijkstra's Algorithm


- Traffic Information Systems are most
prominent use
- Mapping (Map Quest, Google Maps)
- Routing Systems

Applications of Dijkstra's Algorithm


One particularly relevant this week:
epidemiology
Prof. Lauren Meyers (Biology Dept.)
uses networks to model the spread of
infectious diseases and design prevention
and response strategies.
Vertices represent individuals, and
edges their possible contacts. It is useful
to calculate how a particular individual is
connected to others.
Knowing the shortest path lengths to
other individuals can be a relevant
indicator of the potential of a particular
individual to infect others.

You might also like