Consider a DAG (directed acyclic graph) G with positive edge weights, a source vertex s and all vertices reachable from

[answerhappygod]

Consider A Dag Directed Acyclic Graph G With Positive Edge Weights A Source Vertex S And All Vertices Reachable From 1 (84.29 KiB) Viewed 11 times

Consider a DAG (directed acyclic graph) G with positive edge weights, a source vertex s and all vertices reachable from s. Assuming that the shortest-paths algorithm for DAGS and Dijkstra's shortest-paths algorithm are run on G to compute shortest paths from s to all other vertices, select all correct statements. None of the other sentences is correct. The asymptotic worst-case running times of these two algorithms are of the same order. Both algorithms perform the same number of relax operations. These two algorithms may consider vertices (in the main loop) in different order. Both algorithms consider vertices (in the man loop) in the same order. 0 C ☐☐