Match List I with List II List I List II A. Dijkstra's Algorithm I. Calculates…

Solution:

Match each algorithm from List I to its correct description from List II and brief justification:

• Dijkstra's Algorithm → Stores the total cost from a source node to the current node. Dijkstra is a single-source shortest-path algorithm that maintains the best-known distance (total cost) from the source to every node.

• Prim's Algorithm → Stores/chooses minimum cost edges to grow a spanning tree. Prim's builds an MST by repeatedly selecting the minimum-weight edge connecting the growing tree to a new vertex.

• Warshall's Algorithm → Calculates a path matrix (transitive closure / reachability). Warshall's algorithm determines reachability information or path existence between all pairs of nodes, producing a path matrix.

• Kruskal's Algorithm → Finds a Minimum Spanning Tree. Kruskal's constructs an MST by sorting edges by weight and adding the smallest edges that do not form cycles.

Therefore, the correct correspondences are:

• Dijkstra's Algorithm matched with the description about storing total cost from a source node.

• Prim's Algorithm matched with the description about selecting/storing minimum-cost edges to grow a tree.

• Warshall's Algorithm matched with the description about calculating a path matrix.

• Kruskal's Algorithm matched with the description about finding a Minimum Spanning Tree.