#include
#include
#include
//創建領接矩陣存儲頂點信息
#define?MaxInt?32767				//表示極大值即是無窮
#define?MVNum?100					//表示最大頂點數
#define?MAX_NAME?8					//?頂點字符串的最大長度+1
#define?OK?1
#define?ERROR?0
#define?OVERFLOW?-2
typedef?char?VertexType[MAX_NAME];	//?頂點數據類型及長度
typedef?int?ArcType;???				//邊的權值類型為整型
typedef?int?Status;

int?Vexset[MVNum];					//輔助數組，標識頂點所屬的連通分量


//構建順序表
typedef?struct{
	//順序表中的結點信息
	VertexType?Head;
	VertexType?Tail;
	ArcType?lowcost;

}Edge;
typedef?struct??//建立線性表輔助存儲邊的信息
{
	Edge?*elem;
	int?length;
}SqList;

//初始化順序表
Status?InitList（SqList?&L）{
	L.elem?=?（Edge*）malloc（MVNum*sizeof（SqList））;
	if（!L.elem）{
		exit（OVERFLOW）;
	}
	L.length=0;
	return?OK;
}

typedef?struct{			//鄰接矩陣結構體
	VertexType?vexs[MVNum];//頂點表
	ArcType?arcs[MVNum][MVNum];//鄰接矩陣
	int?vexnumarcnum;			//無向網的當前點數和邊數
}AMGraph;

//定義根據頂點信息查找頂點在vexs數組中的位置
Status?LocateVex（AMGraph?GVertexType?v）{
	int?i;
	for（i=0;i		if（strcmp（vG.vexs[i]）==0）//兩串相等，返回下標
			return?i;
	}
	return?ERROR;
}
//創建鄰接矩陣并且輸入相關信息
Status?CreatUDN（AMGraph?&GSqList?&L）{
	int?ijk;
	ArcType?power;//儲存權值的變量
	VertexType?v1v2;//儲存輸入的頂點信息
	printf（“請輸入總頂點數，總邊數并以回車鍵進行確認\n“）;
	scanf（“%d%d“&G.vexnum&G.arcnum）;//輸入總的頂點數和邊數
	L.length=G.arcnum+1;//定義順序表長度
	for（i=0;i		printf（“請輸入第%d個點的名稱:“（i+1））;
		fflush（stdin）;//吃掉回車符
		scanf（“%s“G.vexs[i]）;
		printf（“\n“）;
	}
	for（i=0;i		for（j=0;j			G.arcs[i][j]=MaxInt;
	for（k=0;k	//	printf（“請輸入第%d條邊依附的頂點及權值，用逗號隔開并用回車鍵進行確認:“（k+1））;
		fflush（stdin）;
		printf（“請您輸入第%d邊頂點信息：“（k+1））;
		scanf（“%s“v1）;
		printf（“\n“）;
		fflush（stdin）;
		printf（“請您輸入%d邊尾頂點信息：“（k+1））;
		scanf（“%s“v2）;
		printf（“\n“）;
		printf（“請您輸入%d邊權值信息：“（k+1））;
		scanf（“%d“&power）;
		//為線性表賦值
		strcpy（L.elem[k+1].Head?v1）;
		strcpy（L.elem[k+1].Tail?v2）;
		L.elem[k+1].lowcost=power;

		//找出對應下標并為無向網賦權值
		i=LocateVex（Gv1）;j=LocateVex（Gv2）;
		G.arcs[i][j]=power;
		G.arcs[j][i]=power;
	}
	return?OK;
}


//堆排序算法

void?HeapAdjust（SqList?&Lint?sint?m）{//調整堆方法
	int?j;

	L.elem[0]=L.elem[s];
	for?（j=2*s;j<=m;j*=2）
	{
		if（j			++j;
		}
		if（L.elem[0].lowcost>=L.elem[j].lowcost）{
			break;
		}
		L.elem[s]=L.elem[j];s=j;
	}
	L.elem[s]=L.elem[0];
}

void?CreatHeap（SqList?&L）{//建立初始的堆
	int?ni;
	n=L.length-1;
	for?（i=n/2;i>0;--i）
	{
		HeapAdjust（Lin）;
	}
}

void?HeapSort（SqList?&L）{//堆排序
	int?i;

	CreatHeap（L）;
	for（i=L.length-1;i>1;--i）{
		L.elem[0]=L.elem[1];
		L.elem[1]=L.elem[i];
		L.elem[i]=L.elem[0];
		HeapAdjust（L1i-1）;
	}
	
}


//克魯斯卡爾算法構建最小生成樹
void?MiniSpanTree_Kruskal（AMGraph?GSqList?&L）{
	int?v1v2;
	int?vs1vs2;
	int?inum=0j;
	HeapSort（L）;
	//輸出排序過后的順序表
	/*
	for（i=0;i		printf（“%d--->>>??%s??%s??%d\n“iL.elem[i].HeadL.elem[i].TailL.e

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2016-01-29?09:33??計科142班?王少峰?20141514201\
?????文件????????3688??2015-12-26?10:31??計科142班?王少峰?20141514201\Clear_Skin_1.swf
?????文件????????9288??2015-12-26?10:31??計科142班?王少峰?20141514201\FLVPlayer_Progressive.swf
?????目錄???????????0??2016-01-29?09:33??計科142班?王少峰?20141514201\scripts\
?????文件?????????773??2015-12-26?10:32??計科142班?王少峰?20141514201\scripts\expressInstall.swf
?????文件???????22365??2015-12-26?10:32??計科142班?王少峰?20141514201\scripts\swfobject_modified.js
?????文件????????4316??2015-12-26?16:55??計科142班?王少峰?20141514201\baifeng.html
?????文件????????4386??2015-12-26?16:19??計科142班?王少峰?20141514201\chilian.html
?????目錄???????????0??2016-01-29?09:33??計科142班?王少峰?20141514201\css\
?????文件????????1965??2015-12-25?20:27??計科142班?王少峰?20141514201\css\index.css
?????文件????????2019??2015-12-26?17:56??計科142班?王少峰?20141514201\css\jian.css
?????文件????????1211??2015-12-20?15:15??計科142班?王少峰?20141514201\css\login.css
?????文件????????2177??2015-12-25?20:21??計科142班?王少峰?20141514201\css\menpai.css
?????文件????????1941??2015-12-26?20:07??計科142班?王少峰?20141514201\css\renwu.css
?????文件????????2063??2015-12-26?10:49??計科142班?王少峰?20141514201\css\zhutiqu.css
?????文件????????4290??2015-12-26?20:22??計科142班?王少峰?20141514201\genie.html
?????文件????????4459??2015-12-26?21:05??計科142班?王少峰?20141514201\genie_1.html
?????文件????????7755??2015-12-23?15:51??計科142班?王少峰?20141514201\index.html
?????文件????????7075??2015-12-26?17:54??計科142班?王少峰?20141514201\jian.html
?????文件????????2014??2015-12-20?15:27??計科142班?王少峰?20141514201\login.html
?????文件????????9251??2015-12-25?20:24??計科142班?王少峰?20141514201\menpai.html
?????目錄???????????0??2016-01-29?09:33??計科142班?王少峰?20141514201\pic\
?????文件???????49040??2015-12-21?21:06??計科142班?王少峰?20141514201\pic\2_1.jpg
?????文件???????21285??2015-12-24?19:46??計科142班?王少峰?20141514201\pic\2_2.jpg
?????文件???????36095??2015-12-21?21:07??計科142班?王少峰?20141514201\pic\2_3.jpg
?????文件???????39473??2015-12-21?21:06??計科142班?王少峰?20141514201\pic\2_4.jpeg
?????文件???????31510??2015-12-21?21:07??計科142班?王少峰?20141514201\pic\2_5.jpg
?????文件???????40425??2015-12-21?21:05??計科142班?王少峰?20141514201\pic\2_6.jpg
?????文件???????41538??2015-12-21?21:06??計科142班?王少峰?20141514201\pic\2_7.jpg
?????文件???????47821??2015-12-21?21:05??計科142班?王少峰?20141514201\pic\2_8.jpg
?????文件??????115227??2015-12-20?11:18??計科142班?王少峰?20141514201\pic\6.jpg
............此處省略52個文件信息