forked from krahets/hello-algo
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: add Swift codes for graph_traversal article (krahets#378)
* feat: add Swift codes for graph_traversal article * refactor: rename parameters * Update graph_dfs.swift --------- Co-authored-by: Yudong Jin <[email protected]>
- Loading branch information
Showing
7 changed files
with
136 additions
and
13 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| graph_adjacency_list.swift |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,56 @@ | ||
| /** | ||
| * File: graph_bfs.swift | ||
| * Created Time: 2023-02-21 | ||
| * Author: nuomi1 ([email protected]) | ||
| */ | ||
|
|
||
| import graph_adjacency_list_target | ||
| import utils | ||
|
|
||
| /* 广度优先遍历 BFS */ | ||
| // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点 | ||
| func graphBFS(graph: GraphAdjList, startVet: Vertex) -> [Vertex] { | ||
| // 顶点遍历序列 | ||
| var res: [Vertex] = [] | ||
| // 哈希表，用于记录已被访问过的顶点 | ||
| var visited: Set<Vertex> = [startVet] | ||
| // 队列用于实现 BFS | ||
| var que: [Vertex] = [startVet] | ||
| // 以顶点 vet 为起点，循环直至访问完所有顶点 | ||
| while !que.isEmpty { | ||
| let vet = que.removeFirst() // 队首顶点出队 | ||
| res.append(vet) // 记录访问顶点 | ||
| // 遍历该顶点的所有邻接顶点 | ||
| for adjVet in graph.adjList[vet] ?? [] { | ||
| if visited.contains(adjVet) { | ||
| continue // 跳过已被访问过的顶点 | ||
| } | ||
| que.append(adjVet) // 只入队未访问的顶点 | ||
| visited.insert(adjVet) // 标记该顶点已被访问 | ||
| } | ||
| } | ||
| // 返回顶点遍历序列 | ||
| return res | ||
| } | ||
|
|
||
| @main | ||
| enum GraphBFS { | ||
| /* Driver Code */ | ||
| static func main() { | ||
| /* 初始化无向图 */ | ||
| let v = Vertex.valsToVets(vals: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) | ||
| let edges = [ | ||
| [v[0], v[1]], [v[0], v[3]], [v[1], v[2]], [v[1], v[4]], | ||
| [v[2], v[5]], [v[3], v[4]], [v[3], v[6]], [v[4], v[5]], | ||
| [v[4], v[7]], [v[5], v[8]], [v[6], v[7]], [v[7], v[8]], | ||
| ] | ||
| let graph = GraphAdjList(edges: edges) | ||
| print("\n初始化后，图为") | ||
| graph.print() | ||
|
|
||
| /* 广度优先遍历 BFS */ | ||
| let res = graphBFS(graph: graph, startVet: v[0]) | ||
| print("\n广度优先遍历（BFS）顶点序列为") | ||
| print(Vertex.vetsToVals(vets: res)) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,54 @@ | ||
| /** | ||
| * File: graph_dfs.swift | ||
| * Created Time: 2023-02-21 | ||
| * Author: nuomi1 ([email protected]) | ||
| */ | ||
|
|
||
| import graph_adjacency_list_target | ||
| import utils | ||
|
|
||
| /* 深度优先遍历 DFS 辅助函数 */ | ||
| func dfs(graph: GraphAdjList, visited: inout Set<Vertex>, res: inout [Vertex], vet: Vertex) { | ||
| res.append(vet) // 记录访问顶点 | ||
| visited.insert(vet) // 标记该顶点已被访问 | ||
| // 遍历该顶点的所有邻接顶点 | ||
| for adjVet in graph.adjList[vet] ?? [] { | ||
| if visited.contains(adjVet) { | ||
| continue // 跳过已被访问过的顶点 | ||
| } | ||
| // 递归访问邻接顶点 | ||
| dfs(graph: graph, visited: &visited, res: &res, vet: adjVet) | ||
| } | ||
| } | ||
|
|
||
| /* 深度优先遍历 DFS */ | ||
| // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点 | ||
| func graphDFS(graph: GraphAdjList, startVet: Vertex) -> [Vertex] { | ||
| // 顶点遍历序列 | ||
| var res: [Vertex] = [] | ||
| // 哈希表，用于记录已被访问过的顶点 | ||
| var visited: Set<Vertex> = [] | ||
| dfs(graph: graph, visited: &visited, res: &res, vet: startVet) | ||
| return res | ||
| } | ||
|
|
||
| @main | ||
| enum GraphDFS { | ||
| /* Driver Code */ | ||
| static func main() { | ||
| /* 初始化无向图 */ | ||
| let v = Vertex.valsToVets(vals: [0, 1, 2, 3, 4, 5, 6]) | ||
| let edges = [ | ||
| [v[0], v[1]], [v[0], v[3]], [v[1], v[2]], | ||
| [v[2], v[5]], [v[4], v[5]], [v[5], v[6]], | ||
| ] | ||
| let graph = GraphAdjList(edges: edges) | ||
| print("\n初始化后，图为") | ||
| graph.print() | ||
|
|
||
| /* 深度优先遍历 DFS */ | ||
| let res = graphDFS(graph: graph, startVet: v[0]) | ||
| print("\n深度优先遍历（DFS）顶点序列为") | ||
| print(Vertex.vetsToVals(vets: res)) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters