邻接矩阵创建无向网

#include<iostream>
const int MaxInt = 32767;//极大值
const int MVNum = 100;//最大顶点数

using namespace std;

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


int LocateVex(AMGraph G, char v)
{
	for (int i = 0; i < G.vexnum; i++)
		if (G.vexs[i] == v)
			return i;
}


//算法6.1采用邻接矩阵表示法创建无向网
int CreateUDN(AMGraph &G)
{//采用邻接矩阵表示法，创建无向网G
	char a;
	cout<<"输入总顶点数,总边数:"<<endl;
	cin>>G.vexnum>>G.arcnum;

	
	cout<<"依次输入"<<G.vexnum<<"个顶点的信息：";
	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;

	cout<<"下面开始构造邻接矩阵：";
	char v1, v2; int w, i, j;
	for (int k = 0; k < G.arcnum; k++)
	{
		cout<<"输入一条边依附的顶点及权值："<<endl;
		cin>>v1>>v2>>w;
		i = LocateVex(G, v1); j = LocateVex(G, v2);
		G.arcs[i][j] = w;
		G.arcs[j][i] = G.arcs[i][j];
	}
	return 1;
}


int PrintUDN(AMGraph G)
{
	int i, j;
	cout<<"顶点元素是:";
	for (i = 0; i < G.vexnum; i++)
	    cout << "vexs[" << i << "]=" << G.vexs[i]<<"  ";
	cout<<"\n构造的邻接矩阵是："<<endl;
	for (i = 0; i < G.vexnum; i++)
	{
		for (j = 0; j < G.vexnum; j++)
			printf("%7d ", G.arcs[i][j]);
		printf("\n");
	}
	return 1;
}


int main()
{
	AMGraph G;
	CreateUDN(G);
	PrintUDN(G);
	system("pause");
	return 0;
}