The first step of the minimal spanning tree solution method is to
A) select any starting node.
B) select the node closest to the starting node to join the spanning tree.
C) select the closest node not presently in the spanning tree.
D) arbitrarily select any path in the network from origin to destination.

Question

Quizplus · Accepted Answer

The first step in the minimal spanning tree solution method is to select any starting node. This is because the minimal spanning tree algorithm, such as Kruskal's or Prim's, does not require a specific starting node; any node can serve as the starting point for building the minimal spanning tree.

The First Step of the Minimal Spanning Tree Solution Method