---

数据结构—邻接矩阵的DFS

---

---

原理：参考趣学数据结构

---

---

代码：

#include<stdio.h>
#include<stdlib.h>
#define N 100
#define elemType int
//const int MAX_INT = (1 << 31) - 1;
//const int MAX_INT = 0X7fffffff;
#define  INF    (((unsigned int)(-1)) >> 1)
bool visited[N];
typedef struct GraphMatrix {elemType vNode[N][N];int vNum, eNum;
}GraphMatrix;
void initGMaxtix(GraphMatrix &G) {//初始化邻接矩阵printf("输入顶点数和边数\n");scanf_s("%d%d", &G.vNum, &G.eNum);for (int i = 0; i < G.vNum; i++) {//初始化邻接矩阵for (int j = 0; j < G.vNum; j++) {G.vNode[i][j] = INF;}}printf("输入顶点v1到顶点v2和其边的权重\n");for (int i = 0; i < G.eNum; i++) {int v1, v2, weights;scanf_s("%d%d%d", &v1, &v2, &weights);G.vNode[v1][v2] = weights;}
}
void print11(GraphMatrix G) {printf("邻接矩阵如下:\n");for (int i = 0; i < G.vNum; i++) {for (int j = 0; j < G.vNum; j++) {printf("%d ", G.vNode[i][j]);}printf("\n");}
}
void DFSMatrixGraph(GraphMatrix G, int u) {//DFS遍历邻接矩阵visited[u] = true;printf("%d ", u);for (int i = 0; i < G.vNum; i++) {if (!visited[i] && G.vNode[u][i] < INF) {DFSMatrixGraph(G, i);}}
}
int main() {GraphMatrix G;initGMaxtix(G);print11(G);printf("\n");for (int i = 0; i < G.vNum; i++) {visited[i] = false;}printf("DFS遍历邻接矩阵\n");DFSMatrixGraph(G, 0);printf("\n");system("pause");return 0;
}

---

测试截图：

时间复杂度O(n x n)，空间复杂度O(n)

如果存在什么问题，欢迎批评指正！谢谢！