Question

Given the following directed graph, 1. (15 points) Find the shortest paths from every node to node 1 using the Dijkstra's algorithm. 2. (15 points) Find the shortest paths from every node to node 1 using the Bellman-ford algorithm. Assume the edges are ordered alphabetically first by the from vertices and then by the to vertices: (2, 1), (3, 1), (3, 2), (3, 4), (4, 2), (4, 3), (4, 5), (5, 2), (5, 4), (5, 6), (6, 3), (6, 4), (6, 5), (7, 5), (7, 6) Note: This is single-destination shortest path instead of SSSP.

          Given the following directed graph,
1. (15 points) Find the shortest paths from every node to node 1 using the Dijkstra's algorithm.
2. (15 points) Find the shortest paths from every node to node 1 using the Bellman-ford algorithm.
Assume the edges are ordered alphabetically first by the from vertices and then by the to vertices:
(2, 1), (3, 1), (3, 2), (3, 4), (4, 2), (4, 3), (4, 5), (5, 2), (5, 4), (5, 6), (6, 3), (6, 4), (6, 5), (7, 5), (7, 6)
Note: This is single-destination shortest path instead of SSSP.

Given the following directed graph,
1. (15 points) Find the shortest paths from every node to node 1 using the Dijkstra's algorithm.
2. (15 points) Find the shortest paths from every node to node 1 using the Bellman-ford algorithm.
Assume the edges are ordered alphabetically first by the from vertices and then by the to vertices:
(2, 1), (3, 1), (3, 2), (3, 4), (4, 2), (4, 3), (4, 5), (5, 2), (5, 4), (5, 6), (6, 3), (6, 4), (6, 5), (7, 5), (7, 6)
Note: This is single-destination shortest path instead of SSSP.

Added by John C.

Question

Please give Ace some feedback