In Prim's algorithm for the minimal spanning tree, we start at a designated vertex, which we call the ____ vertex.
A) index
B) source
C) root
D) destination

Name: In Prim's algorithm for the minimal spanning tree, we start at a designated vertex, which we call the ____ vertex. A) index B) source C) root D) destination
Brand: Quizplus
Rating: 4.9 (29 reviews)

Question

Quizplus · Accepted Answer

In Prim's algorithm, the process begins at a designated vertex known as the source vertex, from which the algorithm grows the minimal spanning tree.

In Prim's Algorithm for the Minimal Spanning Tree, We Start