Scribd
Upload
19 views2 pages

P2 Prim's Algorithm

The document implements Prim's algorithm in C to find the minimum cost spanning tree of an undirected graph. It includes the code to create an adjacency matrix representing the graph, initialize arrays for distance and parent nodes, and iteratively add edges to the spanning tree while tracking the total cost.

Uploaded by

incharabs23
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
19 views2 pages

P2 Prim's Algorithm

The document implements Prim's algorithm in C to find the minimum cost spanning tree of an undirected graph. It includes the code to create an adjacency matrix representing the graph, initialize arrays for distance and parent nodes, and iteratively add edges to the spanning tree while tracking the total cost.

Uploaded by

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

2.

Design and implement C/C++ Program to find Minimum Cost Spanning Tree of a
given connected undirected graph using Prim's algorithm.
// Prim's Algorithm in C

#include<stdio.h>
#include<stdlib.h>
#define inf 99999
#define MAX 10
int G[MAX][MAX] = {
{0, 19, 8},
{21, 0, 13},
{15, 18, 0}
};
int S[MAX][MAX], n;
int prims();

int main(){
int i, j, cost;
n = 3;
cost=prims();
printf("Spanning tree:");
for (i=0; i<n; i++) { // start of outer for-1
printf("\n");
for (j=0; j<n; j++) { // start of inner for-1
printf("%d\t",S[i][j]);
}} // end of outer and inner for – 1 (nested)
printf("\nMinimum cost = %d", cost);
return 0;
}

int prims(){
int C[MAX][MAX];
int u, v, min_dist, dist[MAX], from[MAX];
int visited[MAX],ne,i,min_cost,j;

//create cost[][] matrix,spanning[][]


for(i=0; i<n; i++)
for(j=0; j<n; j++) {
if(G[i][j]==0)
C[i][j]=inf;
else
C[i][j]=G[i][j];
S[i][j]=0;
}

//initialise visited[],distance[] and from[]


dist[0]=0;
visited[0]=1;
for(i=1; i<n; i++) {
dist[i] = C[0][i];
from[i] = 0;
visited[i] = 0;
}
min_cost = 0; //cost of spanning tree
ne = n-1; //no. of edges to be added
while(ne > 0) {

//find the vertex at minimum distance from the tree


min_dist = inf;
for(i=1; i<n; i++)
if(visited[i] == 0 && dist[i] < min_dist) {
v = i;
min_dist = dist[i];
}
u = from[v];

//insert the edge in spanning tree


S[u][v] = dist[v];
S[v][u] = dist[v];
ne--;
visited[v]=1;

//updated the distance[] array


for(i=1; i<n; i++)
if(visited[i] == 0 && C[i][v] < dist[i]) {
dist[i] = C[i][v];
from[i] = v;
}
min_cost = min_cost + C[u][v];
}
return(min_cost);
}

You might also like