Closed avisha191 closed 1 week ago
Prim's Algorithm constructs a Minimum Spanning Tree by starting from a vertex and iteratively adding the smallest weight edge that connects an unvisited vertex to the growing spanning tree.
Prim's Algorithm constructs a Minimum Spanning Tree by starting from a vertex and iteratively adding the smallest weight edge that connects an unvisited vertex to the growing spanning tree.