In the minimal spanning tree algorithm given in the text, the algorithm is finished and a solution is found when all arcs have been included in the minimal spanning tree.

Name: In the minimal spanning tree algorithm given in the text, the algorithm is finished and a solution is found when all arcs have been included in the minimal spanning tree.
Brand: Quizplus
Rating: 4.9 (29 reviews)

Question

Quizplus · Accepted Answer

The algorithm is finished when all vertices, not all arcs, have been included in the minimal spanning tree.

In the Minimal Spanning Tree Algorithm Given in the Text