Q11
Which algorithm is used to find the minimum spanning tree in a graph?
A.
Prim's Algorithm
B.
Floyd-Warshall Algorithm
C.
Bellman-Ford Algorithm
D.
Kruskal's Algorithm
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board