السلام عليكم
ممكن تن تنظروا فى هذل الكود
it use to build minimum spaning tree
ارجوكم ردوا علي
#include
#include
#include
#include
void main (void)
{
char a[200][200]={0};
char aa[200][200]={0};
int i,j,b=0,v=0;
i=1,j=0;
int n;
cout<<"plese enter the number of node of graph";
cin>>n;
n=n+1;
while(i
{
puts("plese enter a node ");
fflush(stdin);
cin>>a[j];
aa[j]=a[j];
i++;
}
i=1,j=0;
int c=1,d=0;
while(i
{
a[0][c++]=a[0];
aa[0][j]=a[j];
i++;
}
char z,x;
cout<<"plese enter two node and wight betwen them if you went to end program enter ?";
while(x!='?')
{
fflush(stdin);
cin>>x,z,c;
i=0,j=0;
for(;(i
for(;(j
if(j
{
puts("hi");
a[j]=c;
cout<<"plese enter two node and wight betwen them if you want to end program enter ?");