数据结构之图的邻接矩阵存储(参考C博客—研究毛)

#include<iostream>
using namespace std;
#define MAXVEX 100
#define INFINITY 65535
typedef int EdgeType;
typedef char VertexType;
typedef struct
{
	VertexType Vex[MAXVEX];
	EdgeType Arc[MAXVEX][MAXVEX];
	int Vnums;
	int Enums;
}MGraph;
void CreateMGraph(MGraph &G)
{
	int i, j,k,w;
	cin >> G.Vnums >> G.Enums;
	for (i = 0; i < G.Vnums; ++i)
		cin >> G.Vex[i];
	for (i = 0; i < G.Vnums; ++i)
	{
		for (j = 0; j < G.Vnums; ++j)
		{
			if (i == j)
				G.Arc[i][j] = 0;
			else
				G.Arc[i][j] = INFINITY;
		}
	}
	for (k = 0; k < G.Enums; ++k)
	{
		cin >> i >> j >> w;
		G.Arc[i][j] = w;
		G.Arc[j][i] = G.Arc[i][j];
	}
}
int main(void)
{
	MGraph G;
	CreateMGraph(G);
	return 0;
}