Dynamic Programming Exercises

Bellman-Ford

1. For each graph, for each iteration of the Bellman-Ford algorithm, for each vertex, display the distances to the bottom vertex (starting with the top vertex):
   Digraph 1:
   
   Digraph 2:
   
   Digraph 3 (simple model of taking a job directly after high school or going to college first, so maximizing cost instead of minimizing it):
   
   Digraph 4:
   
   

Last Modified: