采用邻接矩阵表示法创建无向网

#include<iostream>
using namespace std;
#define maxint 32767//表示极大值，即无穷
#define mvnum 100//最大顶点数
typedef int arctype;//设顶点的数据类型为字符型
typedef char vertextype;//假设边的权值类型为整型
typedef struct
{
	vertextype vexs[mvnum];//顶点表
	arctype arcs[mvnum][mvnum];//邻接矩阵
	int vexnum, arcnum;
}amgraph;
bool createUDN(amgraph& G)//采用邻接矩阵表示法，创建无向网G
{
	cin >> G.vexnum >> G.arcnum;
	for (int i = 0;i < G.vexnum;i++)
	{
		cin >> G.vexs[i];
	}
	for (int i = 0;i < G.vexnum;i++)
	{
		for (int j = 0;j < G.vexnum;j++)
		{
			G.arcs[i][j] = maxint;
		}
	}
	for (int k = 0;k < G.arcnum;k++)
	{
		int v1, v2, w;
		cin >> v1 >> v2 >> w;
		int i = locatevex(G, v1);
		int j = locatevex(G, v2);
		G.arcs[i][j] = w;
		G.arcs[j][i] = G.arcs[i][j];
	}
	return 1;
}
int locatevex(amgraph G, vertextype V)//在图G中查找顶点，成功则返回顶点表中的下标，失败返回-1
{
	for (int i = 0;i < G.vexnum;i++)
	{
		if (V == G.vexs[i])
		{
			return i;
		}
	}
	return -1;
}



int main()
{




	return 0;
}