Q19
Which of the following algorithms can be used to find the Minimum Spanning Tree (MST) of a graph?
A.
Dijkstra's Algorithm
B.
Depth-First Search (DFS)
C.
Bellman-Ford Algorithm
D.
Prim's Algorithm and Kruskal's Algorithm
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board