network operating

In your submission, please show the details of how the algorithms work.

Problem 1. Given the following graph, use Dijkstra's shortest path algorithm to find shortest paths starting from node A.

Problem 2. Given the following graph, can you still use Dijkstra's shortest path algorithm to find shortest paths from node S? If you cannot, try Bellman-Ford algorithm.