The Bellman-Ford Algorithm Illustrate how Bellman-Fords algorithm works on an directed graph G(V,E) with a weight function w:ER .

The source is vertex E .

Explain all the steps and draw the drawing on a piece of paper

- Illustrate how Bellman-Ford's algorithm works on an directed graph G(V,E) with a weight function w:ER. - The source is vertex E. - In the lecture, we proposed Prim's algorithm using an adjacency matrix as input for edges. - Note: Edges are stored alphabetically in the adjacency list. Hint: Follow the Figure 24.4