Scribd
Upload
6 views

Prim

Prims algorithm

Uploaded by

gautamkrishnakumar555
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Prim

Prims algorithm

Uploaded by

gautamkrishnakumar555
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Gautam Krishna Kumar

23BKT031

Prim's Algorithm
A Prim’s algorithm comes under a greedy algorithm and is used to
discover the minimum spanning tree from a graph.
Beginning with a single node, Prim’s algorithm analyses each
subsequent node along with all of its associated edges, with one
vertex, we continue to add edges with the lowest weight until we
attain our objective.

• Set up the minimum spanning tree using a randomly chosen


vertex.
• Find the minimum of all the edges connecting the tree to
further vertices, then add it to the tree.
• Repeat step 2 as necessary to obtain a minimum spanning tree.

• Algorithm
• Stage 1: Choose a starting vertex
• Stage 2: Repetition of Steps 3 and 4 until the fringe vertex is present.
• Stage 3: Choose an edge with a minimum weight that connects the
tree vertex and the fringe vertex.
• Stage 4: Include the chosen vertex and edge in the least spanning
tree T.
• [FINISH OF LOOP]
• Stage 5: EXIT

You might also like