Data Structures Using C 2 E Chapter 12

Data Structures Using C++ 2 E Chapter 12 Graphs - Examples

Initialization 0 ∞ ∞ ∞ 6 Step 1 0 ∞ 28 11 6 Step 2 0 ∞ 28 11 6 Step 3 0 35 28 11 6 Step 4 0 35 28 11 6 0 1 2 3 4 (a) (b) (c) (d) (e) http: //www. dgp. toronto. edu/~jstewart/270/9798 s/Laffra/Dijkstra. Applet. html smallest. Weight Initialization T F F Step 1 T F F F T Step 2 T F F T T Step 3 T F T T T Step 4 T T T 0 1 2 3 4 (a) (b) (c) (d) (e) weight. Found 2

Init: Init V(T) = { E(T) = { Compare Edges: d Ø d - a (5) d - b (9) d - e (15) d - f (6) Step 1: V(T) = { E(T) = { Compare Edges: a, d (d, a) d - b (9) d - e (15) d - f (6) a - b (7) Step 2: V(T) = { E(T) = { Compare Edges: a, d, f (d, a), (d, f) d - b (9) d - e (15) a - b (7) f - e (8) f - g (11) Step 3: V(T) = { E(T) = { Compare Edges: a, b, d, f (d, a), (d, f), (a, b) d - e (15) f - e (8) f - g (11) b - c (8) b - e (7) 3

Step 4: V(T) = { a, b, d, f, e (d, a), (d, f), (a, b), (b, e) d - e (15) f - e (8) Compare Edges: f - g (11) b - c (8) Step 5: V(T) = { a, b, d, f, e (d, a), (d, f), (a, b), (b, e) f - g (11) b - c (8) Compare Edges: e - c (5) e - g (9) Step 6: V(T) = { a, b, c, d, e, f (d, a), (d, f), (a, b), (b, e), (e, c) f - g (11) Compare Edges: e - g (9) Step 7: V(T) = { a, b, c, d, e, f, g (d, a), (d, f), (a, b), (b, e), (e, c), (e, g) 4