Illustrate running of Bellman-Ford algorithm on the following graph. Source vertex is 4. Show all steps for full credit.
Vertex
Outgoing Edge and their Weights
1
w(1,2) = 3
w(1,3) = 7
w(1,5) = -4
w(1,6) = -5
2
w(2,4) = 1
w(2,5) = 7
3
w(3,2) = 4
Source: 4
w(4,1) = 2
w(4,3) = -5
w(4,6) = 2
5
w(5,4) = 6
w(5,6) = -4
6
w(6,5) = 5
When iterating over the edges, use the following order:
(1,2), (1,3), (1,5), (1,6), (2,4), (2,5), (3,2), (4,1), (4,3), (4,6), (5,4), (5,6), (6,5)