CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 03:30:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update code style for Python

Browse Source
This commit is contained in:
krahets
2023-03-03 03:07:22 +08:00
parent 7e9e6b000c
commit 7c501140f0
45 changed files with 274 additions and 266 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
codes/python/chapter_graph/graph_bfs.py
View File

@@ -6,12 +6,12 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
from graph_adjacency_list import GraphAdjList
""" 广度优先遍历 BFS """
# 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]:
""" 广度优先遍历 BFS """
# 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
# 顶点遍历序列
res = []
# 哈希表，用于记录已被访问过的顶点
@@ -32,6 +32,7 @@ def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]:
return res
""" Driver Code """
if __name__ == "__main__":
"""初始化无向图"""
v = vals_to_vets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
@@ -45,4 +46,4 @@ if __name__ == "__main__":
"""广度优先遍历 BFS"""
res = graph_bfs(graph, v[0])
print("\n广度优先遍历（BFS）顶点序列为")
print(vets_to_vals(res))
print(vets_to_vals(res))