dfs——邻接矩阵遍历

/*
以邻接矩阵实现无向图
并任选一点进行dfs遍历
*/

#include<stdio.h>
void visiting(int v) {
	printf("\n访问%d点",v);
}
void dfs(int arr[6][6],int v,bool *visit) {
	visiting(v);
	visit[v] = true;
	int i;
	for (i = 1; i < 6; i++) {
		if (arr[v][i] == 1 && visit[i] == false) {
			dfs(arr,i,visit);
		}
	}
}
int main() {
	//定义无向图
	int arr[6][6] = { 0,0,0,0,0,0,
					 0,0,1,0,0,1,
					 0,1,0,1,1,0,
					 0,0,1,0,1,1,
					 0,0,1,1,0,1,
					 0,1,0,1,1,0 };
	//定义访问点集
	bool visit[6] = { false };
	int v = 3, i = 3;
	printf("以点%d为原点进行访问",v);
	dfs(arr,i,visit);
	return 0;
}