数据结构实验（13）

数据结构实验（C++）

PS:仅数据结构实验记录
在 n 个城市之间架设 n-1 条线路，要求建设代价最小。编写完整算法构造 最小生成树。

#include<iostream>
using namespace std;
const int MAX_SIZE = 10;				//假设城市最大值为10
int visited[MAX_SIZE] = { 0 };
#include<time.h>

template<typename DataType>
class MGraph
{
public:
	//初始化邻接矩阵
	MGraph(DataType a[], int n)		//一个存储权值的邻接矩阵
	{
		srand((unsigned int)time(NULL));
		int i, j;
		vertexNum = n; 
		//存储顶点
		for (i = 0; i < vertexNum; i++)
{
			vertex[i] = a[i];
}
		//初始化邻接矩阵;由随机数产生1到100的权值
		for (i = 0; i < vertexNum; i++)
		{
			for (j = 0; j < vertexNum; j++)
			{
				edge[i][j] = 0;
				edge[j][i] = 0;
			}
		}
		//由随机数产生1到100的权值
		for (i = 0; i < vertexNum; i++)
		{
			for (int j = i + 1; j < vertexNum; j++)
			{
				edge[i][j] = rand() % 100 + 1;
				edge[j][i] = edge[i][j];
			}
		}
		//打印各边权值
		for (int i = 0; i < vertexNum; i++)
		{
			for (int j = i + 1; j < vertexNum; j++)
			{
				cout << vertex[i] << "——" << vertex[j] << " : " << edge[i][j] << "\t";
			}
			cout << endl;
		}
	}

	~MGraph() {}
	void Search_Min_Tree(int v);			//查找最小生成树
	int MinEdge(int r[], int n);
	void Prim(int v);
private:
	DataType vertex[MAX_SIZE];			//存储顶点
	int edge[MAX_SIZE][MAX_SIZE];		//存储边
	int vertexNum;						//记录点数
};

template<typename DataType>
void MGraph<DataType>::Prim(int v)							//从顶点v出发
{
	int i, j, k;
	int adjvex[MAX_SIZE], lowcost[MAX_SIZE];
	for (i = 0; i < vertexNum; i++)							//初始化辅助数组
	{
		lowcost[i] = edge[v][i]; adjvex[i] = v;
	}
	lowcost[v] = 0;										//将顶点v加入集合U
	for (k = 1; k < vertexNum; k++)							//迭代n-1次
	{
		j = MinEdge(lowcost, vertexNum);				//寻找最短边的邻接点j
		cout << "(" << vertex[j] << "," << vertex[adjvex[j]] << ")" << lowcost[j] << endl;
		lowcost[j] = 0;									//顶点j加入集合U
		for (i = 0; i < vertexNum; i++)				//调整辅助数组
			if (edge[i][j] < lowcost[i]) {
				lowcost[i] = edge[i][j];
				adjvex[i] = j;
			}
	}
}

template<typename DataType>
int MGraph<DataType>::MinEdge(int r[], int n)
{
	int index = 0, min = 100;     //此处如果仅记载最小值下标会有bug
	for (int i = 1; i < n; i++)
		if (r[i] != 0 && r[i] < min)
		{
			min = r[i]; index = i;
		}
	return index;
}

//测试
int main()
{
	//设n个城市
	string ch[] = { "a","b","c","d","e","f","g","h","i","j" };
	MGraph<string> MG(ch, 10);
	cout << "\n测试图的最小生成树：" << endl;
	MG.Prim(0);
	return 0;
}

测试结果
本次实验测试数据为：10个城市，各个城市之间的造价由随机数产生；