UGC NET Computer Science Q57

Question

Match List - I with List II.
List - I
(A) Dijkstra's Algorithms
(B) Floyd-Warshall Algorithms
(C) Bellman-Ford Algorithms
(D) Prim's Algorithms
List - II
(I) Find the shortest path between all pairs of vertices in a graph with positive or negative edge weights.
(II) Finds the shortest path in a weighted graph with non-negative edge weights.
(III) Sorts elements by repeatedly moving them past neighboring elements that are smaller.
(IV) Determines the strongest connected components in a directed graph.
Choose the correct answer from the options given below :

Accepted Answer

(A)-(II), (B)-(I), (C)-(IV), (D)-(III)