克鲁斯卡尔求最小生成树

[twlkyao]

#include <iostream>
#include <stdio.h>
#include <malloc.h>
#define MAX_TREE_SIZE 100
using namespace std;

typedef struct PTNode//结点的结构
{
char data;
int parent;
}PTNode,*PTNodeType;

typedef struct EdgeNode//边结点的结构
{
int u;
int weight;
int v;
}EdgeNode,*EdgeType;

int main()
{
EdgeType Edge;//用于存放边的信息的数组
PTNodeType Node;//用于存放顶点的信息的数组
int i,j,k,e,n,temp1,temp2,temp3;
cout<<"请输入图的边数:e"<<endl;
cin>>e;
Edge=(EdgeType)malloc(e*sizeof(EdgeNode));
cout<<"请输入图的顶点数:n"<<endl;
cin>>n;
Node=(PTNodeType)malloc(n*sizeof(PTNode));
cout<<"下面开始输入边的信息!"<<endl;
for(i=0;i<e;i++)
{
cout<<"请输入第"<<i+1<<"条边的信息:(u,weight,v)"<<endl;
cin>>Edge[i].u;
cin>>Edge[i].weight;
cin>>Edge[i].v;
}
cout<<"边的信息输入结束.下面输入顶点的信息!"<<endl;
cout<<"请按顺序输入顶点的信息!"<<endl;
for(i=0;i<n;i++)
{
cout<<"第"<<i+1<<"个顶点的信息"<<endl;
cin>>Node[i].data;
Node[i].parent=i+1;
}
for(i=0;i<e;i++)
for(j=0;j<e-1;j++)
{
if(Edge[j].weight>Edge[j+1].weight)
{
temp1=Edge[j+1].u;
temp2=Edge[j+1].weight;
temp3=Edge[j+1].v;
Edge[j+1].u=Edge[j].u;
Edge[j+1].weight=Edge[j].weight;
Edge[j+1].v=Edge[j].v;
Edge[j].u=temp1;
Edge[j].weight=temp2;
Edge[j].v=temp3;
}
}
/*for(i=0;i<e;i++)
{
cout<<Edge[i].weight<<' ';
}//测试排序 */
for(j=0,k=1;j<e && k<n;j++)
{
if(Node[Edge[j].u-1].parent!=0 || Node[Edge[j].v-1].parent!=0)//Edge[j].u和Edge[j].v树根不同
{
cout<<Node[Edge[j].u-1].data<<"-"<<Edge[j].weight<<"-"<<Node[Edge[j].v-1].data<<endl;
Node[Edge[j].u-1].parent=0;
Node[Edge[j].v-1].parent=0;
k++;
}
}
return 0;
}





为什么生成树的边会莫名其妙的少几条呢？