Design and Analysis of Algorithms

Single-source shortest paths, all-pairs

shortest paths

Haidong Xue
Summer 2012, at GSU
Single-source shortest paths
Single-source shortest paths
1

2 3
10
9
3 2
1 6 4

5
7
4 5

Given this weighted, directed graph, what is the weight of

path: <1, 2, 4>?

10+2=12
Single-source shortest paths
1

2 3
10
9
3 2
1 6 4

5
7
4 5

Given this weighted, directed graph, what is the weight of

path: <1, 2, 4, 2, 4>?

10+2 + 3 + 2 = 17
Single-source shortest paths
1

2 3
10
9
3 2
1 6 4

5
7
4 5

Given this weighted, directed graph, what is the weight of

path: <1, 2, 4, 1>?
Single-source shortest paths
1

2 3
10
9
3 2
1 -6 4

5
7
4 5

Given this weighted, directed graph, what is the weight of

path: <5, 3, 5> and <5, 3, 5, 3, 5>??

4-6 = -2 and -6+4-6+4 = -4

Negative cycle There is no shortest path from 1 to 5

 Single-source shortest paths
Shortest path of a pair of vertices <u, v>: a
path from u to v, with minimum path weight
Applications:
Your GPS navigator
If weights are time, it produces the fastest route
If weights are gas cost, it produces the lowest cost
route
If weights are distance, it produces the shortest
route
 Single-source shortest paths
Single-source shortest path problem: given a
weighted, directed graph G=(V, E) with source
vertex s, find all the shortest (least weight)
paths from s to all vertices in V.
 Single-source shortest paths
Two classic algorithms to solve single-source
shortest path problem
Bellman-Ford algorithm
A dynamic programming algorithm
Works when some weights are negative
Dijkstras algorithm
A greedy algorithm
Faster than Bellman-Ford
Works when weights are all non-negative
 Bellman-Ford algorithm
Observation:
If there is a negative cycle, there is no solution
Add this cycle again can always produces a less weight path
If there is no negative cycle, a shortest path has at most |V|-1
edges

Idea:
Solve it using dynamic programming
For all the paths have at most 0 edge, find all the shortest paths
For all the paths have at most 1 edge, find all the shortest paths

For all the paths have at most |V|-1 edge, find all the shortest
paths
Bellman-Ford algorithm
//Initialize 0-edge shortest paths

//bottom-up construct 0-to-(|V|-1)-edges shortest paths

//test negative cycle

 Bellman-Ford algorithm
e.g.
20
0
10 1
1 2 3

What is the 0-edge shortest path from 1 to 1?

<> with path weight 0
What is the 0-edge shortest path from 1 to 2?

What is the 0-edge shortest path from 1 to 3?

 Bellman-Ford algorithm
e.g.
20
0
10 1
1 2 3

What is the at most 1-edge shortest path from 1 to 1?

<> with path weight 0
What is the at most 1-edge shortest path from 1 to 2?
<1, 2> with path weight 10

What is the at most 1-edge shortest path from 1 to 3?

<1, 3> with path weight 20

In Bellman-Ford, they are calculated by scan all edges once

 Bellman-Ford algorithm
e.g.
20
0 20
10 1
1 2 3

What is the at most 2-edges shortest path from 1 to 1?

<> with path weight 0
What is the at most 2-edges shortest path from 1 to 2?
<1, 2> with path weight 10

What is the at most 2-edges shortest path from 1 to 3?

<1, 2, 3> with path weight 11

In Bellman-Ford, they are calculated by scan all edges once

 Bellman-Ford algorithm
All 0 edge shortest paths

-2
2 3
6
-3
0
8
1 7
-4
7 2
4 5

9
 Bellman-Ford algorithm
Calculate all at most 1 edge
shortest paths 5

-2
2 3
6
-3
0 /0
8
1 7
-4
7 2
4 5

9
 Bellman-Ford algorithm
Calculate all at most 2 edges
shortest paths 5
6 /11
/4
-2
2 3
6
-3
0 /0
8
1 7
-4
7 2
4 5
7 /2
/7
9
 Bellman-Ford algorithm
Calculate all at most 3 edges
shortest paths 5
6 4 /4
-2
2 3
6
-3
0 /0
8
1 7
-4
7 2
4 5
7 /7 2 /2
9
 Bellman-Ford algorithm
Calculate all at most 4 edges
shortest paths 5
2 4 /4
-2
2 3
6
-3
0 /0
8
1 7
-4
7 2
4 5
7 /7 2 /-2
9
 Bellman-Ford algorithm
Final result:
5
2 4
-2
2 3
6
-3
0
8
1 7
-4
7 2
4 5
7 -2
9
What is the shortest path 1, 4, 3, 2, 5
from 1 to 5?
What is the shortest path
What is weight of this path? -2 from 1 to 2, 3, and 4?
Dijkstras Algorithm
 Dijkstras Algorithm
The shortest path of the vertex with smallest distance is
determined
1

2 3
10

0 9
3 2
1 6 4

5
7
4 5

2
 Dijkstras Algorithm
Choose a vertex whose shortest path is now determined

1
10

2 3
10

0 9
3 2
1 6 4

5
7
4 5

2
 Dijkstras Algorithm
Choose a vertex whose shortest path is now determined

1
8 14

2 3
10

0 9
3 2
1 6 4

5
7
4 5

2
 Dijkstras Algorithm
Choose a vertex whose shortest path is now determined

1
8 13

2 3
10

0 9
3 2
1 6 4

5
7
4 5

2
 Dijkstras Algorithm
Choose a vertex whose shortest path is now determined

1
8 9

2 3
10

0 9
3 2
1 6 4

5
7
4 5

2
 Dijkstras Algorithm
Final result:

1
8 9

2 3
10

0 9
3 2
1 6 4

5
7
4 5

What is the shortest path 1, 4, 5

from 1 to 5?
What is the shortest path
What is weight of this path? 7 from 1 to 2, 3, and 4?
All-pairs shortest paths
All-pairs shortest paths
All-pairs shortest paths
 All-pairs shortest paths
What are the weights of shortest paths with
no intermediate vertices, D(0)?

1 2

9
1 2 3 4
3
1 0
6 4
2 4
3 3 2
3 4 4 6 0

2
 All-pairs shortest paths
D(0)
1 2 3 4
1 0
1 2 2 0 4
3 3 2 0 9
2
3 4 6 0
6 4
What are the weights of shortest paths with
intermediate vertex 1?
3 D(1)
4
1 2 3 4
9
1 0
2 0 4
3 3 0 9
4 6 0
 All-pairs shortest paths
D(1)
1 2 3 4
1 0
1 2 2 0 4
3 3 0 9
2
3 4 6 0
6 4
What are the weights of shortest paths with
intermediate vertices 1 and 2?
3 D(2)
4
1 2 3 4
9
1 0
2 0 4
3 3 0 6
4 6 0
 All-pairs shortest paths
D(2)

1 2 3 4
1 0
1 2 2 0 4
2
3 3 0 6
3
4 6 0
6 4
What are the weights of shortest paths with
intermediate vertices 1, 2 and 3?
3 4 D(3)
1 2 3 4
9
1 0
2 0 4
3 3 0 6
4 6 0
 All-pairs shortest paths
D(3)

1 2 3 4
1 0
1 2 2 0 4
3 3 0 6
2
3 4 6 0
6 4
What are the weights of shortest paths with
intermediate vertices 1, 2, 3 and 4?
D(4)
3 4
1 2 3 4
9 1 0
2 0 4
3 3 0 6
4 6 0
 All-pairs shortest paths
Add predecessor information to reconstruct a shortest path
If updated the predecessor i-j in D(k) is the same as the predecessor k-j in D(k-1)
D(0) D(1)
1 2 3 4 1 2 3 4
1 0/n 1 0/n
2 0/n 4/2 2 0/n 4/2
3 3/3 0/n 9/3 3 3/3 0/n 9/3
4 6/4 0/n 4 6/4 0/n
D(2) D(3)

1 2 3 4 1 2 3 4
1 0/n 1 0/n
2 0/n 4/2 2 0/n 4/2
3 3/3 0/n 6/2 3 3/3 0/n 6/2
6/4 0/n 4 6/4 0/n
4
 All-pairs shortest paths

D(4)
1 2
1 2 3 4
1 0/n 2
3
2 0/n 4/2 6 4
3 3/3 0/n 6/2
4 6/4 0/n
3 4

9
What is the shortest path 3, 2, 4
from 3 to 4?
What is weight of this path? 6