mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-01 03:24:24 +08:00
f68bbb0d59
* Revised the book * Update the book with the second revised edition * Revise base on the manuscript of the first edition
76 lines
2.1 KiB
C
76 lines
2.1 KiB
C
/**
|
||
* File: graph_dfs.c
|
||
* Created Time: 2023-07-13
|
||
* Author: NI-SW (947743645@qq.com)
|
||
*/
|
||
|
||
#include "graph_adjacency_list.c"
|
||
|
||
// 假设节点最大数量为 100
|
||
#define MAX_SIZE 100
|
||
|
||
/* 检查顶点是否已被访问 */
|
||
int isVisited(Vertex **res, int size, Vertex *vet) {
|
||
// 遍历查找节点，使用 O(n) 时间
|
||
for (int i = 0; i < size; i++) {
|
||
if (res[i] == vet) {
|
||
return 1;
|
||
}
|
||
}
|
||
return 0;
|
||
}
|
||
|
||
/* 深度优先遍历辅助函数 */
|
||
void dfs(GraphAdjList *graph, Vertex **res, int *resSize, Vertex *vet) {
|
||
// 记录访问顶点
|
||
res[(*resSize)++] = vet;
|
||
// 遍历该顶点的所有邻接顶点
|
||
AdjListNode *node = findNode(graph, vet);
|
||
while (node != NULL) {
|
||
// 跳过已被访问的顶点
|
||
if (!isVisited(res, *resSize, node->vertex)) {
|
||
// 递归访问邻接顶点
|
||
dfs(graph, res, resSize, node->vertex);
|
||
}
|
||
node = node->next;
|
||
}
|
||
}
|
||
|
||
/* 深度优先遍历 */
|
||
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
|
||
void graphDFS(GraphAdjList *graph, Vertex *startVet, Vertex **res, int *resSize) {
|
||
dfs(graph, res, resSize, startVet);
|
||
}
|
||
|
||
/* Driver Code */
|
||
int main() {
|
||
// 初始化无向图
|
||
int vals[] = {0, 1, 2, 3, 4, 5, 6};
|
||
int size = sizeof(vals) / sizeof(vals[0]);
|
||
Vertex **v = valsToVets(vals, size);
|
||
Vertex *edges[][2] = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]}, {v[2], v[5]}, {v[4], v[5]}, {v[5], v[6]}};
|
||
int egdeSize = sizeof(edges) / sizeof(edges[0]);
|
||
GraphAdjList *graph = newGraphAdjList();
|
||
// 添加所有顶点和边
|
||
for (int i = 0; i < size; i++) {
|
||
addVertex(graph, v[i]);
|
||
}
|
||
for (int i = 0; i < egdeSize; i++) {
|
||
addEdge(graph, edges[i][0], edges[i][1]);
|
||
}
|
||
printf("\n初始化后，图为\n");
|
||
printGraph(graph);
|
||
|
||
// 深度优先遍历
|
||
Vertex *res[MAX_SIZE];
|
||
int resSize = 0;
|
||
graphDFS(graph, v[0], res, &resSize);
|
||
printf("\n深度优先遍历（DFS）顶点序列为\n");
|
||
printArray(vetsToVals(res, resSize), resSize);
|
||
|
||
// 释放内存
|
||
delGraphAdjList(graph);
|
||
free(v);
|
||
return 0;
|
||
}
|