数据结构

MGraph(int a[], int n, int e)
{
	int vertexNum = n, edgeNum = e;
	for (int i = 0; i < vertexNum; i++)			//存储顶点
	{
		vertex[i] = a[i];
	}
	for (int i = 0; i < vertexNum; i++)			//初始化邻接矩阵
	{
		for (int j = 0; j < vertexNum; j++)
		{
			edge[i][j] = 0;
		}
	}
	for (int k = 0; i < edgeNum; k++)			//依次输入每一条边
	{
		cin >> i >> j;							//输入边的两个顶点
		edge[i][j] = edge[j][i] = 1;			//置有边
	}
}