Prim's algorithm is to grow the minimum spanning tree by adding

Prim's algorithm is to grow the minimum spanning tree by adding one edge, and thus an associated vertex, to the tree in each stage. ~@[](1)

答案：TRUE