Match List I with List II

1. Aa-I, b-II, c-III, d-IV
2. Ba-III, b-II, c-I, d-IV
3. Ca-II, b-I, c-IV, d-III
4. Da-III, b-IV, c-II, d-I

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. a-III, b-II, c-I, d-IV

Explanation

Dijkstra stores the total cost from the source to each node; Prim stores the minimum-cost edge to each vertex; Warshall computes the path (reachability) matrix; Kruskal finds a minimum spanning tree.