最小生成树问题.doc

文档介绍：// 自定义头文件
#define Max_Num_Arcnum 100
typedef char VertexType;
typedef struct TreeNode
{
VertexType ch;
i "<<[i].toVertex<<" weight : "<<[i].weight<<endl;

m_Sum += [i].weight;
}
}

cout<<endl<<" 结果得最低成本代价 = "<<m_Sum<<endl<<"************************************"<<endl;
outFile<<endl<<" 结果得最低成本代价 = "<<m_Sum<<endl<<"************************************"<<endl;
}
// 显示最初输入数据
void KryskaNode::Display()
{
int i;
cout<<"---------显示图信息---------"<<endl;
cout<<" **顶点如下**"<<endl<<" ";

for(i=0;i<;i++)
{
cout<<Node[i].ch<<" ";
}

cout<<endl<<" **线路信息如下** "<<endl;

for(i=0;i<;i++)
{
cout<<" edge : "<<[i].fromVertex<<" "<<[i].toVertex<<" weight : "<<[i].weight<<endl;
}
cout<<"-----------------------------"<<endl<<endl;
}
// 初始化每个顶点为一个集合
void KryskaNode::Initial(VertexType node[])
{
int i ;
for(i=0;i<;i++)
{
Node[i].ch = node[i];
Node[i].num = i;
}
}
// 查找所在集合
int KryskaNode::Find(VertexType x)
{
for(int i=0;i<;i++)
{
if(Node[i].ch == x)
{
return Node[i].num;
}
}
}
// 合并两个集合
void KryskaNode::Merge(VertexType x,VertexType y)
{
int fromnum , tonum;
fromnum = Find(x);
tonum = Find(y);
for(int i=0;i<gra