In finding the minimal spanning tree in a network using the algorithm in the text, if a tie occurs in the shortest arc from connected nodes to a node that is not connected, it may not be broken arbitrarily.

Question

Quizplus · Accepted Answer

In finding the minimal spanning tree, if a tie occurs in the shortest arc from connected nodes to a node that is not connected, it can indeed be broken arbitrarily without affecting the final minimal spanning tree.

In Finding the Minimal Spanning Tree in a Network Using