Scribd
Upload
194 views2 pages

Prims

Prim's algorithm is used to find the minimum spanning tree of a graph by starting with a single node and exploring adjacent nodes, selecting the edge with the minimum weight that avoids cycles. It works by (1) selecting a starting vertex, (2) selecting the minimum weight edge connecting a tree vertex to a non-tree vertex, adding it to the tree, and (3) repeating step 2 until all vertices are included. An example applies Prim's algorithm to find the minimum spanning tree of a sample graph.

Uploaded by

vansh
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
194 views2 pages

Prims

Prim's algorithm is used to find the minimum spanning tree of a graph by starting with a single node and exploring adjacent nodes, selecting the edge with the minimum weight that avoids cycles. It works by (1) selecting a starting vertex, (2) selecting the minimum weight edge connecting a tree vertex to a non-tree vertex, adding it to the tree, and (3) repeating step 2 until all vertices are included. An example applies Prim's algorithm to find the minimum spanning tree of a sample graph.

Uploaded by

vansh
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/ 2

Prim's Algorithm

Prim's Algorithm is used to find the minimum spanning tree from a graph. Prim's algorithm finds
the subset of edges that includes every vertex of the graph such that the sum of the weights of the
edges can be minimized.

Prim's algorithm starts with the single node and explore all the adjacent nodes with all the
connecting edges at every step. The edges with the minimal weights causing no cycles in the
graph got selected.

The algorithm is given as follows.

Algorithm

o Step 1: Select a starting vertex


o Step 2: Repeat Steps 3 and 4 until there are fringe vertices
o Step 3: Select an edge e connecting the tree vertex and fringe vertex that has minimum
weight
o Step 4: Add the selected edge and the vertex to the minimum spanning tree T
[END OF LOOP]
o Step 5: EXIT

Example :

Construct a minimum spanning tree of the graph given in the following figure by using prim's
algorithm.
Solution

o Step 1 : Choose a starting vertex B.


o Step 2: Add the vertices that are adjacent to A. the edges that connecting the vertices are
shown by dotted lines.
o Step 3: Choose the edge with the minimum weight among all. i.e. BD and add it to MST.
Add the adjacent vertices of D i.e. C and E.
o Step 3: Choose the edge with the minimum weight among all. In this case, the edges DE
and CD are such edges. Add them to MST and explore the adjacent of C i.e. E and A.
o Step 4: Choose the edge with the minimum weight i.e. CA. We can't choose CE as it
would cause cycle in the graph.

The graph produces in the step 4 is the minimum spanning tree of the graph shown in the above
figure.

The cost of MST will be calculated as;

cost(MST) = 4 + 2 + 1 + 3 = 10 units.

You might also like