In the minimal spanning tree algorithm given in the text, the length of the spanning tree will differ depending upon the starting node used in the algorithm.

Question

Quizplus · Accepted Answer

The minimal spanning tree of a graph is unique in terms of total weight (assuming all edge weights are distinct), regardless of the starting node, because it is determined by the edges included, not the starting node. Algorithms like Prim's or Kruskal's may start from different nodes or edges but will result in the same total weight for the minimal spanning tree.

In the Minimal Spanning Tree Algorithm Given in the Text