Run the BellmanFord algorithm on the following directed grap

Run the Bellman-Ford algorithm on the following directed graph as shown in Figure 24.4 in the textbook, using vertex f as the source. In each pass, relax edges in the order: (a,e), (b,a), (b,d), (c,b), (c,f), (d,a), (d,e), (e,b), (f,b), (f,c) and show the d and pi values after each pass.

Solution

Here the vertex d can be used along with to present all the lines.

The line (d,a) is parallel to (e,b); (d,e) is parallel to (b,a) (c,a) is parallel to (d,e); (d,a) is along the direction of (d,a) and also to (c,f) and so on.