c语言对于图的存储（领接矩阵）及遍历（DFS,BFS）

这里介绍用邻接矩阵存储无序图，以及利用深度遍历和广度遍历对存储的图进行遍历。详细步骤会进行注释解析。

#include <stdio.h>
#define MAX 20

typedef int Vertex;                          

Vertex visit[MAX] = { 0 };           //定义两个全局数组，在遍历时用于判读该点是否已访问
Vertex visit2[MAX] = { 0 };

int arr[MAX] = { 0 };                   //定义一个类似于队列的数组和头尾指针，主要用于广度遍历
int top=0;
int bottom=0;

typedef struct GNode{            //定义点图的基本结构体
	int NV;                                 //表示图的总点数
	int Ne;                                 //表示图的总边数
	int G[MAX][MAX];               //存储图的邻接矩阵
}*PtrToGNode;
typedef PtrToGNode MGraph;

typedef struct ENode{            //定义的边的基本结构体，包含弧尾，狐头
	Vertex V1, V2;
	int weight;                          //代表边的权重
}*PtrToEGNode;
typedef PtrToEGNode Edge;

MGraph CreateGraph(int VertexNum){             //生成一个无边的散点图
	Vertex V, W;
	MGraph Graph;

	Graph = (MGraph)malloc(sizeof(struct GNode));
	Graph->NV = VertexNum;                           //统计点的总数
	Graph->Ne = 0;
	for (V = 0; V < Graph->NV; V++)
		for (W = 0; W < Graph->NV; W++)
			Graph->G[V][W] = 0;
	return Graph;
}

void InsertEdge(MGraph Graph, Edge E){         //连接边
	Graph->G[E->V1][E->V2] = E->weight;         //将两点进行连接，如果是无向图，还需反响连接
	Graph->G[E->V2][E->V1] = E->weight;
}

MGraph BuildGraph(){ 
	MGraph Graph;
	Edge E;
	Vertex v;
	int Nv, i;
	printf("请输入图的总顶点数：");
	scanf("%d", &Nv);
	Graph = CreateGraph(Nv);
	printf("请输入图的总边数：");
	scanf("%d", &(Graph->Ne));
	if (Graph->Ne != 0){
		E = (Edge)malloc(sizeof(struct ENode));
		for (i = 0; i < Graph->Ne; i++){
			printf("请输入第%d条边的三个参数（弧尾下标，弧头下标，权值）：",i+1);
			scanf("%d%d%d", &E->V1, &E->V2, &E->weight);
			InsertEdge(Graph, E);
		}
	}
	return Graph;
}

void DFS(Vertex v,MGraph Graph){             //对于图的深度遍历
	int j;
	visit2[v] = 1;
	printf("%d\n", v);
	for (j = 0; j < Graph->NV; j++){
		if (Graph->G[v][j] == 1 && visit2[j] == 0)
			DFS(j, Graph);
	}
}

void BFS(Vertex v, MGraph Graph){       //对于图的广度遍历
	int j;
	
	if (visit[v]==0)
		printf("%d\n", v);
	visit[v] = 1;
	 
	for (j = 0; j < Graph->NV; j++){
		if (Graph->G[v][j] == 1 && visit[j] == 0){
			arr[top++] = j;
			visit[j] = 1;
			printf("%d\n",j);
		}
	}
	if (top == bottom)
		return 1;
	BFS(arr[bottom++], Graph);
}

int main(){
	MGraph i;
	Vertex v;
	i = BuildGraph();
	printf("请输入遍历的起点：");
	scanf("%d",&v);
	printf("领接矩阵的深度遍历为：\n");
	DFS(v, i);
	printf("领接矩阵的广度遍历为：\n");
	BFS(v, i);
	system("pause");
	return 0;
}