08.01 邻接矩阵

一：图

<>有序对 对偶
()无序对

//邻接矩阵创建无向图
#include <iostream>
using namespace std;

#define MaxVnum 100  //顶点数最大值
typedef char VexType;  //顶点的数据类型，根据需要定义
typedef int EdgeType;  //边上权值的数据类型，若不带权值的图，则为0或1
typedef struct {
	VexType Vex[MaxVnum];
	EdgeType Edge[MaxVnum][MaxVnum];
	int vexnum, edgenum; //顶点数，边数
}AMGragh;

int locatevex(AMGragh G, VexType x)
{
	for (int i = 0; i < G.vexnum; i++)//查找顶点信息的下标
		if (x == G.Vex[i])
			return i;
	return -1;//没找到
}

void CreateAMGraph(AMGragh& G)
{
	int i, j;
	VexType u, v;
	cout << "请输入顶点数：" << endl;
	cin >> G.vexnum;
	cout << "请输入边数:" << endl;
	cin >> G.edgenum;
	cout << "请输入顶点信息:" << endl;
	for (int i = 0; i < G.vexnum; i++)//输入顶点信息，存入顶点信息数组
		cin >> G.Vex[i];
	for (int i = 0; i < G.vexnum; i++)//初始化邻接矩阵所有值为0，如果是网，则初始化邻接矩阵为无穷大
		for (int j = 0; j < G.vexnum; j++)
			G.Edge[i][j] = 0;
	cout << "请输入每条边依附的两个顶点：" << endl;
	while (G.edgenum--)
	{
		cin >> u >> v;
		i = locatevex(G, u);//查找顶点u的存储下标
		j = locatevex(G, v);//查找顶点v的存储下标
		if (i != -1 && j != -1)
			G.Edge[i][j] = G.Edge[j][i] = 1; //邻接矩阵储置1
		else
		{
			cout << "输入顶点信息错！请重新输入！" << endl;
			G.edgenum++;//本次输入不算
		}
	}
}

void print(AMGragh G)//输出邻接矩阵
{
	cout << "图的邻接矩阵为：" << endl;
	for (int i = 0; i < G.vexnum; i++)
	{
		for (int j = 0; j < G.vexnum; j++)
			cout << G.Edge[i][j] << "\t";
		cout << endl;
	}
}

int main()
{
	AMGragh G;
	CreateAMGraph(G);
	print(G);
	return 0;
}