Q11
What is the main purpose of a Minimum Spanning Tree (MST) algorithm like Prim's or Kruskal's?
A.
To detect cycles in the graph.
B.
To connect all nodes with minimum total edge weight.
AnswerC.
To find the shortest path in a weighted graph.
D.
To detect cycles in the graph.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board