Prim算法代码 c++（数据结构作业）

#include <iostream>
using namespace std;
#define MVNum 100  //最大顶点数
#define INF 10000 //无穷大

typedef char VerTexType;  //顶点
typedef int ArcType; //边的权值

struct {
	VerTexType adjvex;  //最小边在U中的顶点
	ArcType lowcost;  //最小边上的权值
}closedge[MVNum];

typedef struct {
	VerTexType vexs[MVNum];  //顶点表
	ArcType arcs[MVNum][MVNum];  //邻接矩阵
	int vexnum, arcnum;  //当前的点数和边数
}AMGragh;

int LocateVex(AMGragh G, VerTexType u) {  //获取u点的下标
	//return -1;
	for (int i = 0; i < G.vexnum; i++)
		if (G.vexs[i] == u) 
			return i;
}

int MinVex() {
	int low = 100;
	int k = 100;
	for (int i = 1; i < 6; i++) {
		if (closedge[i].lowcost > 0 && closedge[i].lowcost < low) {
			low = closedge[i].lowcost;
			k = i;
		}
	}
	return k;
}

void MiniSpanTree_Prim(AMGragh G, VerTexType u) {
	int k = LocateVex(G, u);  //获取初始点下标
	for (int j = 0; j < G.vexnum; ++j) {  //初始化closedge
		if (j != k) 
			closedge[j] = { u, G.arcs[k][j] };
		else
			closedge[k].lowcost = 0;
	};
	for (int i = 1; i < G.vexnum; ++i) {
		k = MinVex();  //最小边的下标
		VerTexType u0 = closedge[k].adjvex;  //最小边的一个顶点
		VerTexType v0 = G.vexs[k];  //最小边的另一个顶点
		cout << "v"<<u0 <<"-v"<< v0<<endl;
		closedge[k].lowcost = 0;
		for (int j = 0; j < G.vexnum; ++j)
			if (G.arcs[k][j] < closedge[j].lowcost)
				closedge[j] = { G.vexs[k],G.arcs[k][j] };
	 }
}

int main()
{
	AMGragh G;
	G.vexs[0] = 'v1'; G.vexs[1] = 'v2'; G.vexs[2] = 'v3'; G.vexs[3] = 'v4'; G.vexs[4] = 'v5'; G.vexs[5] = 'v6';
	ArcType a[6][6] = {
		0,6,1,5,INF,INF,
		6,0,5,INF,3,INF,
		1,5,0,5,6,4,
		5,INF,5,0,INF,2,
		INF,3,6,INF,0,6,
		INF,INF,4,2,6,0
	};
	for (int i = 0; i < 6; i++) 
		for (int j = 0; j < 6; j++) 
			G.arcs[i][j] = a[i][j];
	G.vexnum = 6;
	G.arcnum = 10;
	char u = 'v1';
	MiniSpanTree_Prim(G, u);
}