Lec38 Bellmanford FloydWarshall

Algorithms
Shortest Paths II
• Bellman-Ford algorithm
• Floyd-Warshal algorithm
4
November 16, 2005 Copyright © 2001-5 by Erik D. Demaine and Charles E. Leiserson L18.1
Negative-weight cycles
Recall: If a graph G = (V, E) contains a negative-
weight cycle, then some shortest paths may not exist.
…
Example:
<0
uu
vv
Bellman-Ford algorithm
for each v ∈ V
do d[v] ← ∞ initialization
d[s] ← 0
for i ← 1 to ????
do for each edge (u, v) ∈ E
do if d[v] > d[u] + w(u, v) relaxation
then d[v] ← d[u] + w(u, v) step
Intuition: In the beginning start with paths 0 edges.

At step i: consider paths that use upto i edges.
Bellman-Ford algorithm
for each v ∈ V
do d[v] ← ∞ initialization
d[s] ← 0
for i ← 1 to | V | –
1 do for each edge (u, v) ∈ E
do if d[v] > d[u] + w(u, v) relaxation
then d[v] ← d[u] + w(u, v) step
Correctness
Theorem. If G = (V, E) contains no negative-
weight cycles, then after the Bellman-Ford
algorithm executes, d[v] = δ(s, v) for all v ∈ V.
Theorem. If G = (V, E) contains no negative-

weight cycles, then after k iterations of
Bellman-Ford algorithm every node knows
the shortest path from v that uses at most k
edges and the distance of this path.
All-pairs shortest paths
Input: Digraph G = (V, E), where V = {1, 2,
…, n}, with edge-weight function w : E → R.
Output: n × n matrix of shortest-path lengths
δ(i, j) for all i, j ∈ V.
Floyd-Warshall
for k ← 1 to n
do for i ← 1 to n
do for j ← 1 to n
do if dij > dik + dkj
relaxation
then dij ← dik + dkj
Notes:
• In step k above: dij =cost of shortest path from i to j that
uses intermediate nodes only from set {1,2,…k}
• Base k=0: no intermediate nodes; dij = cost of edge <i,j>
• Runs in Θ(V3) time. Simple & Efficient to code.
Example of Bellman-Ford
–1 B 2
3 B 2
A 1 E
A 4 –3 E
C 5
D
C D
∞
–1 B 2
0 ∞
3 B 2
A 1 EE
A 4 –3
C 5
D
C D
Initialization.
∞ ∞
∞
–1 B 1
2
0 7 3 ∞
4
3 B 2
A 5 1 8
E
2
A 4 6
–3 E
C 5
D
C D
Order of∞edge relaxation.
∞
∞
–1 B 1
2
0 7 3 ∞
4
3 B 2
A 5 1 8
E
2
A 4 6
–3 E
C 5
D
C D
∞ ∞
∞
–1 B 1
2
0 7 3 ∞
4
3 B 2
A 5 1 8
E
2
A 4 6
–3 E
C 5
D
C D
∞ ∞
∞
–1 B 1
2
0 7 3 ∞
4
3 B 2
A 5 1 8
E
2
A 4 6
–3 E
C 5
D
C D
∞ ∞
∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
∞ ∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
∞
C D
4 ∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
4 ∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
4
C D
2 ∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 ∞
−
1 1
2
–1
0
4
7 B 3 ∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
End
2 of pass∞1.
−
1 1
2
–1
0
4
7 B 3 1
∞
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 ∞
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 ∞
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C ∞
D
2 1
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 1
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 1
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 1
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
2 1
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C 1
D
2 −
2
−
1 1
2
–1
0
4
7 B 3 1
A 3 2 E
5 B1 2 8
A 4 6
–3 E
C 5
D
C D
End of pass
2 2 (and
− 3 and 4).
2

Lec38 Bellmanford FloydWarshall

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lec38 Bellmanford FloydWarshall

Uploaded by

Copyright:

Available Formats

Algorithms

Intuition: In the beginning start with paths 0 edges.

Theorem. If G = (V, E) contains no negative-

You might also like