(Solved): 5. Shortest Path-Directed Acyclic Graph (10 Points) Find the shortest paths from node A. Sort the v ...

5. Shortest Path-Directed Acyclic Graph (10 Points) Find the shortest paths from node A. Sort the vertices in a topological order and the relax the edges considering the vertices in that order. Draw the trace showing the intermediate distance values of all nodes after each step of the algorithm. Show each step. Show the final shortest path. 5 4 F 3 3 D s 2 E 3 2 6 3 2 4 3 H