最小生成樹的Kruskal算法

給定無向連通加權圖，編程設計求出其一棵最小生成樹

/**********************************************************
[要求]：給定無向連通加權圖，編程設計求出其一棵最小生成樹。


**********************************************************/


#include<iostream>


using namespace std;


const int SIZE = 40;


int circuitJudge(int, int, int, int);      //判斷新加的邊與前面的邊是否構成迴路


int main()
{
int i,j,n;
int a = 1;
int b;
int side[SIZE][SIZE] = { 0 };        //定義存放頂點的side（邊）函數，其中二維數組
                                    //的兩個下標表示邊的兩個頂點，二維數組的值表示這條邊的權




cout<<"輸入無向連通加權圖的結點數:";
cin>>n;


cout<<"若權值爲0，即代表不存在這條邊"<<endl;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
cout<<endl;
cout<<"邊["<<i+1<<"]["<<j+1<<"]的權值爲:";
cin>>side[i][j];
}


cout<<"最小生成數的編號\t起點\t終點\t權值\n";
while (1)
{
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
if (i != j)
{
if (side[i][j] == a)
{
side[j][i] = 0;
b = circuitJudge(i+1,j+1,side[i][j],n);    //判斷新加的邊與前面的邊是否構成迴路
}
}
}


a++;
}


return 0;
}


int circuitJudge (int a, int b, int c, int n)
{
int i;
static int e = 0;
int d = 0,f = 0;
static int capsheaf[SIZE] = { 0 };    //用來存放圖中相互可達的頂點




for (i = 0; i < n; i++)
{
if (a == capsheaf[i])
{
d = 1;
}
}
for (i = 0; i < n; i++)
{
if (b == capsheaf[i])
{
f = 1;
}
}
if (d == 1 && f == 1)
{
return 0;
}
if (d == 1)
{
for (i = 0; i < n; i++)
{
if (capsheaf[i] == 0)
{
capsheaf[i] = b;
cout<<++e<<"\t\t\t"<<a<<"\t"<<b<<"\t"<<c<<endl;
break;
}
}
}
if (f == 1)
{
for (i = 0; i < n; i++)
{
if (capsheaf[i] == 0)
{
capsheaf[i] = a;
cout<<++e<<"\t\t\t"<<a<<"\t"<<b<<"\t"<<c<<endl;
break;
}
}
}
if (d == 0 && f == 0)
{
for (i = 0; i < n; i++)
if (capsheaf[i] == 0)
{
capsheaf[i] = a;
capsheaf[i+1] = b;
cout<<++e<<"\t\t\t"<<a<<"\t"<<b<<"\t"<<c<<endl;
break;
}
}




d = 0;
f = 0;
return 0;
}