#include
#include
#include
using namespace std;
int cost[10][10],i,j,k,n,m,c,visit,visited[10],l,v,count,count1,vst,p;

main()
{
int dup1,dup2;
cout<<"enter no of vertices";
cin >> n;
cout <<"enter no of edges";
cin >>m;
cout <<"EDGE Cost";
for(k=1;k<=m;k++)
{
cin >>i >>j >>c;
cost[i][j]=c;
cost[j][i]=c;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(cost[i][j]==0)
cost[i][j]=31999;
visit=1;
while(visit= 2)
{
for(p=1;p<=n;p++)
if(cost[i][p]!=31999 && p!=j)
dup1=p;
for(p=1;p<=n;p++)
if(cost[j][p]!=31999 && p!=i)
dup2=p;

if(cost[dup1][dup2]==-1)
continue;
}
l=i;
k=j;
v=cost[i][j];
}
cout <<"edge from " <"<
OUTPUT
enter no of vertices4

enter no of edges4

EDGE Cost

1 2 1

2 3 2

3 4 3

1 3 3
edge from 1-->2edge from 2-->3edge from 1-->3
The post C++ programs to implement the Kruskal’s algorithm to generate a minimum cost spanning tree first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-to-implement-the-kruskal%e2%80%99s-algorithm-to-generate-a-minimum-cost-spanning-tree/feed/
			5