Question

Exercise 2 Use Bellman-Ford algorithm to find shortest path from vertex s to all the other vertices on the following graph. Clearly show all your steps in the algorithm by filling the table. 1 A B 5 3 2 4 -1 1 -2 C D 4 Iteration 1 Iteration 2 Iteration 3 Iteration 4 (S,A) (S,C) (A,B) (B,t) (B,D) (C,A) (C,B) (C,D) (D,t)

          Exercise 2
Use Bellman-Ford algorithm to find shortest path from vertex s to all the other vertices
on the following graph. Clearly show all your steps in the algorithm by filling the table.
1
A
B
5
3
2
4
-1
1
-2
C
D
4
Iteration 1
Iteration 2
Iteration 3
Iteration 4
(S,A)
(S,C)
(A,B)
(B,t)
(B,D)
(C,A)
(C,B)
(C,D)
(D,t)

Exercise 2
Use Bellman-Ford algorithm to find shortest path from vertex s to all the other vertices
on the following graph. Clearly show all your steps in the algorithm by filling the table.
1
A
B
5
3
2
4
-1
1
-2
C
D
4
Iteration 1
Iteration 2
Iteration 3
Iteration 4
(S,A)
(S,C)
(A,B)
(B,t)
(B,D)
(C,A)
(C,B)
(C,D)
(D,t)

Added by Matthew A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Michael Feffer

Step 1

The edges are as follows: (S,A), (S,C), (A,B), (B,D), (C,A), (C,B), (C,D). The weights are not provided directly for each edge, so I'll assume the notation (edge, weight) is given in the question and proceed accordingly. **Step 1: Initialization** - Initialize Show more…

Show all steps

Thanks for your feedback!

Use the Bellman-Ford algorithm to find the shortest path from vertex s to all the other vertices on the following graph. Clearly show all your steps in the algorithm by filling the table. 1 Iteration 1 Iteration 2 Iteration 3 Iteration 4 (S,A) (S,C) (A,B) (8,t) (B,D) (C,A) (C,B) (C,D) (0,t)