The minimal spanning tree algorithm is considered to be a(n)
A)greedy algorithm.
B)arc algorithm.
C)non-optimal algorithm.
D)non-feasible algorithm.

Question

Quizplus · Accepted Answer

The minimal spanning tree algorithm is a greedy algorithm because, at each step, it chooses the edge with the smallest weight that does not create a cycle in the current set of chosen edges. This greedy approach leads to the overall minimum spanning tree.

The Minimal Spanning Tree Algorithm Is Considered to Be A(n)