# C Program implement Kruskal’s algorithm.

Write a C Program implement Kruskal’s algorithm.
Kruskal’s algorithm is a greedy algorithm that finds the minimum spanning tree of a graph. Graph should be weighted, connected, and undirected.Minimum spanning tree is a spanning tree with weight less than or equal to the weight of every other spanning tree. Read more about C Programming Language .

`/************************************************************ You can use all the programs on  www.c-program-example.com* for personal and learning purposes. For permissions to use the* programs for commercial purposes,* contact [email protected]* To find more C programs, do visit www.c-program-example.com* and browse!* *                      Happy Coding***********************************************************/#include<stdio.h>#include<conio.h>#include<stdlib.h>int i,j,k,a,b,u,v,n,ne=1;int min,mincost=0,cost[9][9],parent[9];int find(int);int uni(int,int);void main(){ clrscr(); printf("nntImplementation of Kruskal's algorithmnn"); printf("nEnter the no. of verticesn"); scanf("%d",&n); printf("nEnter the cost adjacency matrixn"); for(i=1;i<=n;i++) {  for(j=1;j<=n;j++)  {   scanf("%d",&cost[i][j]);   if(cost[i][j]==0)    cost[i][j]=999;  } } printf("nThe edges of Minimum Cost Spanning Tree arenn"); while(ne<n) {  for(i=1,min=999;i<=n;i++)  {   for(j=1;j<=n;j++)   {    if(cost[i][j]<min)    {     min=cost[i][j];     a=u=i;     b=v=j;    }   }  }  u=find(u);  v=find(v);  if(uni(u,v))  {   printf("n%d edge (%d,%d) =%dn",ne++,a,b,min);   mincost +=min;  }  cost[a][b]=cost[b][a]=999; } printf("ntMinimum cost = %dn",mincost); getch();}int find(int i){ while(parent[i])  i=parent[i]; return i;}int uni(int i,int j){ if(i!=j) {  parent[j]=i;  return 1; } return 0;}`
`Read more Similar C ProgramsData StructuresDijkstras AlgorithmLearn C Programming`

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

# C Program to implement Dijkstra’s algorithm.

C Program to implement Dijkstra’s algorithm. Dijkstra’s Algorithm finds the shortest path with the lower cost in a Graph. Dijkstra’s Algorithm solves the Single Source Shortest Path problem for a Graph. It is a Greedy algorithm and similar to Prim’s algorithm. Read more about C Programming Language .

`/************************************************************ You can use all the programs on  www.c-program-example.com* for personal and learning purposes. For permissions to use the* programs for commercial purposes,* contact [email protected]* To find more C programs, do visit www.c-program-example.com* and browse!* *                      Happy Coding***********************************************************/#include "stdio.h"#include "conio.h"#define infinity 999void dij(int n,int v,int cost[10][10],int dist[]){ int i,u,count,w,flag[10],min; for(i=1;i<=n;i++)  flag[i]=0,dist[i]=cost[v][i]; count=2; while(count<=n) {  min=99;  for(w=1;w<=n;w++)   if(dist[w]<min && !flag[w])    min=dist[w],u=w;  flag[u]=1;  count++;  for(w=1;w<=n;w++)   if((dist[u]+cost[u][w]<dist[w]) && !flag[w])    dist[w]=dist[u]+cost[u][w]; }}void main(){ int n,v,i,j,cost[10][10],dist[10]; clrscr(); printf("n Enter the number of nodes:"); scanf("%d",&n); printf("n Enter the cost matrix:n"); for(i=1;i<=n;i++)  for(j=1;j<=n;j++)  {   scanf("%d",&cost[i][j]);   if(cost[i][j]==0)    cost[i][j]=infinity;  } printf("n Enter the source matrix:"); scanf("%d",&v); dij(n,v,cost,dist); printf("n Shortest path:n"); for(i=1;i<=n;i++)  if(i!=v)   printf("%d->%d,cost=%dn",v,i,dist[i]); getch();}`
`Read more Similar C ProgramsData StructuresPrims AlgorithmLearn C Programming`

You can easily select the code by double clicking on the code area above.
To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

(c) www.c-program-example.com