Question: 24
(Choose 1 answer)
How does the Prim algorithm select the next edge to add to the minimum spanning tree?
A. It chooses the edge with the minimum weight that connects a vertex in the tree to a vertex not yet in the tree.
B. It chooses the edge with the minimum weight that connects two vertices not yet in the tree.
C. It chooses an edge randomly from the set of edges that connect a vertex in the tree to a vertex not yet in
the tree.
D. It chooses the edge with the maximum weight that connects à vertex in the tree to a vertex not yet in the
tree.
