Question

The minimal spanning tree solution algorithm works by defining a subnetwork and __________.

a) Adding nodes randomly
b) Removing nodes sequentially
c) Connecting nodes with the least weight
d) Creating nodes with the highest weight

Answer 1

The minimal spanning tree solution algorithm works by defining a subnetwork and connecting nodes with the least weight.

Step-by-step explanation:

The minimal spanning tree solution algorithm works by defining a subnetwork and connecting nodes with the least weight. The algorithm starts with a single node and iteratively adds nodes to the subnetwork while ensuring that all nodes in the subnetwork are connected with the minimum weight edges.