algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-25 11:13:38 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-11-27 02:32:06 +08:00
parent 32d5bd97aa
commit a4a23e2488
31 changed files with 179 additions and 213 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
docs/chapter_graph/graph_traversal.md
View File

@ -121,9 +121,9 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
List<Vertex> GraphBFS(GraphAdjList graph, Vertex startVet) {
// 顶点遍历序列
List<Vertex> res = new();
List<Vertex> res = [];
// 哈希表，用于记录已被访问过的顶点
HashSet<Vertex> visited = new() { startVet };
HashSet<Vertex> visited = [startVet];
// 队列用于实现 BFS
Queue<Vertex> que = new();
que.Enqueue(startVet);
@ -579,9 +579,9 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
List<Vertex> GraphDFS(GraphAdjList graph, Vertex startVet) {
// 顶点遍历序列
List<Vertex> res = new();
List<Vertex> res = [];
// 哈希表，用于记录已被访问过的顶点
HashSet<Vertex> visited = new();
HashSet<Vertex> visited = [];
DFS(graph, visited, res, startVet);
return res;
}