Q:Question:Dag-Shortest-Paths (G, w, s) topologically sort the vertices of G INITIALIZE-SINGLE-SOURCE (G, s) for each vertex u, taken in topologically sorted order for each vertex v ? G �·Adj[u] RELAX(u, v, w) /r/n a. Imagine we change line 3 of the algorithm to read: 3 for the first |V|-1 verticies, taken in topological sorted order Show that the procedure would remain corrctA:Answer:Answer:- The given algorithm DAG-SHORTEST-PATHS(G,...