In a minimal spanning tree solution, which of the following is not true?
A) If you add one more arc to it, it will no longer be a minimal spanning tree
B) If you remove an arc, it will no longer be a spanning tree
C) You can find the shortest route by picking from the minimum spanning tree judiciously
D) There may be alternate minimal spanning trees in a problem

Question

In a minimal spanning tree solution, which of the following is not true? 
A) If you add one more arc to it, it will no longer be a minimal spanning tree
B) If you remove an arc, it will no longer be a spanning tree
C) You can find the shortest route by picking from the minimum spanning tree judiciously
D) There may be alternate minimal spanning trees in a problem

Quizplus · Accepted Answer

A minimal spanning tree (MST) is designed to connect all nodes in a graph with the minimum total edge weight; it does not guarantee the shortest path between any two specific nodes. The shortest route between two nodes might not be a direct path in the MST but could involve traversing through other nodes, which is not the primary goal of an MST.

In a Minimal Spanning Tree Solution, Which of the Following