图的最小生成树

#ifndef _ _MY_KRUSKAL_H_ _

#define _ _MY_KRUSKAL_H_ _

#include"adj_list_undir_network.h"

#include"equivalence.h"

#include"min_priority_lk_queue.h"

template

struct KruskalEdge

{

int vertex1,vertex2;

WeightType weight;

KruskalEdge(int v1=-1,int v2=-1,int w=0):vertex1(v1),vertex2(v2),weight(w){};

};

template

bool operator<=(const KruskalEdge &first,const KruskalEdge &second) {

return first.weight<=second.weight;

}

template

void MiniSpanTreeKruskal(const AdjListUndirNetwork &net)

{

int vexNum=net.GetVexNum();

Equivalence equival(vexNum);

MinPriorityLinkQueue< KruskalEdge >prioQ;

for (int v=0;v

{

for(int u=net.FirstAdjVex(v);u>=0;u=net.NextAdjVex(v,u))

{

if(v

{

KruskalEdgekEdge(v,u,net.GetWeight(v,u));

prioQ.InQueue(kEdge);

}

}

}

for(int count=0;count

{

KruskalEdgekEdge;

prioQ.OutQueue(kEdge);

int v1=kEdge.vertex1,v2=kEdge.vertex2;

if(equival.Differ(v1,v2))

{

cout<<"edge:("<

<

count++;

equival.Union(v1,v2);

}

}

}

#endif

#include "stdafx.h"

#include"Kruskal.h"

#include"utility.h"

int _tmain(int argc, _TCHAR* argv[])

{

try

{

int infity=DEFAULT_INFINITY;

char vexs[]={'A','B','C','D'};

int m[4][4]={

{infity,2,3,4},

{2,infity,5,6},

{3,5,infity,7},

{4,6,7,infity}

};

int n=4;

AdjListUndirNetwork net(vexs,n);

for(int u=0;u

{

for(int v=0;v

{if(m[u][v]!=infity) net.InsertEdge(u,v,m[u][v]);

}

}

cout<<"原网"<

Display(net);

cout<

system("PAUSE");

cout<<"Kruskal算法产生最小生成树的边:"<

MiniSpanTreeKruskal(net);

cout<

}

catch(Error err)

{ err.Show();

}

system("PAUSE");

return 0;

}