Scribd
Upload
27 views3 pages

Stdio.h Stdlib.h: // Prim's Algorithm #Include #Include

This document describes Prim's algorithm for finding the minimum spanning tree of a weighted undirected graph. It includes function definitions for creating the graph, finding the minimum weight temporary vertex, and using that to build up the spanning tree by adding edges and updating vertex lengths iteratively until all vertices are included in the tree. The main function calls these routines to compute and output the edges and total weight of the minimum spanning tree for a given graph.

Uploaded by

JAYESH V A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views3 pages

Stdio.h Stdlib.h: // Prim's Algorithm #Include #Include

This document describes Prim's algorithm for finding the minimum spanning tree of a weighted undirected graph. It includes function definitions for creating the graph, finding the minimum weight temporary vertex, and using that to build up the spanning tree by adding edges and updating vertex lengths iteratively until all vertices are included in the tree. The main function calls these routines to compute and output the edges and total weight of the minimum spanning tree for a given graph.

Uploaded by

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

// Prim’s Algorithm

#include<stdio.h>
#include<stdlib.h>

#define MAX 10
#define TEMP 0
#define PERM 1
#define infinity 9999
#define NIL -1

struct edge
{
int u;
int v;
};

int n;
int adj[MAX][MAX];

int predecessor[MAX];
int status[MAX];
int length[MAX];

void create_graph();
void maketree(int r, struct edge tree[MAX]);
int min_temp();

int main()
{
int wt_tree = 0;
int i, root;
struct edge tree[MAX];

create_graph();

printf("\nEnter root vertex : ");


scanf("%d",&root);

maketree(root, tree);

printf("\nEdges to be included in spanning tree are : \n");

for(i=1; i<=n-1; i++)


{
printf("%d-> ",tree[i].u);
printf("%d\n",tree[i].v);
wt_tree += adj[tree[i].u][tree[i].v];
}
printf("\nWeight of spanning tree is : %d\n", wt_tree);

return 0;

}/*End of main()*/

void maketree(int r, struct edge tree[MAX])


{
int current,i;
int count = 0;/*number of vertices in the tree*/
/*Initialize all vertices*/
for(i=0; i<n; i++)
{
predecessor[i] = NIL;
length[i] = infinity;
status[i] = TEMP;
}

/*Make length of root vertex 0*/


length[r] = 0;

while(1)
{
/*Search for temporary vertex with minimum length
and make it current vertex*/
current = min_temp();

if(current == NIL)
{
if(count == n-1) /*No temporary vertex left*/
return;
else /*Temporary vertices left with length infinity*/
{
printf("\nGraph is not connected, No spanning tree possible\n");
exit(1);
}
}

/*Make the current vertex permanent*/


status[current] = PERM;

/*Insert the edge ( predecessor[current], current) into the tree,


except when the current vertex is root*/
if(current != r)
{
count++;
tree[count].u = predecessor[current];
tree[count].v = current;
}

for(i=0; i<n; i++)


if(adj[current][i] > 0 && status[i] == TEMP)
if(adj[current][i] < length[i])
{
predecessor[i] = current;
length[i] = adj[current][i];
}
}

}/*End of make_tree( )*/

/*Returns the temporary vertex with minimum value of length


Returns NIL if no temporary vertex left or
all temporary vertices left have pathLength infinity*/
int min_temp()
{
int i;
int min = infinity;
int k = -1;
for(i=0; i<n; i++)
{
if(status[i] == TEMP && length[i] < min)
{
min = length[i];
k = i;
}
}

return k;
}/*End of min_temp()*/

void create_graph()
{
int i,max_edges,origin,destin,wt;

printf("\nEnter number of vertices : ");


scanf("%d",&n);
max_edges = n*(n-1)/2;

for(i=1; i<=max_edges; i++)


{
printf("\nEnter edge %d(-1 -1 to quit) : ",i);
scanf("%d %d",&origin,&destin);
if((origin == -1) && (destin == -1))
break;
printf("\nEnter weight for this edge : ");
scanf("%d",&wt);
if( origin >= n || destin >= n || origin < 0 || destin < 0)
{
printf("\nInvalid edge!\n");
i--;
}
else
{
adj[origin][destin] = wt;
adj[destin][origin] = wt;
}
}
}

You might also like