Homework #8
No need to submit it, but please do it
Solve the following problems from the book.
Chapter 7: 2, 4, 7, 20, 21, 26, 29, 30, 32, 33
Solve the following additional problems:
A1: Using Bellman-Ford algorithm and Dijkstra algorithm, respectively, find the shortest path tree to node 5 in Figure 7.30.
Solution
