Match List I with List II
|
LIST - I |
LIST - II |
||
|
A. |
Dijkstra's Algorithm |
I. |
Calculates path matrix |
|
B. |
Prim's Algorithm |
II. |
Stores minimum cost edge |
|
C. |
Warshall's Algorithm |
III. |
Stores the total cost from a source node to the current node |
|
D. |
Kruskal's algorithm |
IV. |
Finds Minimum Spanning Tree |
Choose the correct answer from the options given below:
1
A - I, B - II, C - III, D - IV
2
A - III, B - II, C - I, D - IV
3
A - II, B - I, C - IV, D - III
4
A - III, B - IV, C - II, D - I