mirror of
https://github.com/krahets/hello-algo.git
synced 2026-06-15 22:57:48 +08:00
58 lines
1.7 KiB
Python
58 lines
1.7 KiB
Python
"""
|
||
File: graph_dfs.py
|
||
Created Time: 2023-02-23
|
||
Author: krahets (krahets@163.com)
|
||
"""
|
||
|
||
import sys
|
||
from pathlib import Path
|
||
|
||
sys.path.append(str(Path(__file__).parent.parent))
|
||
from modules import Vertex, vets_to_vals, vals_to_vets
|
||
from graph_adjacency_list import GraphAdjList
|
||
|
||
|
||
def dfs(graph: GraphAdjList, visited: set[Vertex], res: list[Vertex], vet: Vertex):
|
||
"""深さ優先走査の補助関数"""
|
||
res.append(vet) # 訪問した頂点を記録
|
||
visited.add(vet) # この頂点を訪問済みにする
|
||
# この頂点のすべての隣接頂点を走査
|
||
for adjVet in graph.adj_list[vet]:
|
||
if adjVet in visited:
|
||
continue # 訪問済みの頂点をスキップ
|
||
# 隣接頂点を再帰的に訪問
|
||
dfs(graph, visited, res, adjVet)
|
||
|
||
|
||
def graph_dfs(graph: GraphAdjList, start_vet: Vertex) -> list[Vertex]:
|
||
"""深さ優先探索"""
|
||
# 指定した頂点の隣接頂点をすべて取得できるよう、隣接リストでグラフを表現する
|
||
# 頂点の走査順序
|
||
res = []
|
||
# 訪問済み頂点を記録するためのハッシュ集合
|
||
visited = set[Vertex]()
|
||
dfs(graph, visited, res, start_vet)
|
||
return res
|
||
|
||
|
||
"""Driver Code"""
|
||
if __name__ == "__main__":
|
||
# 無向グラフを初期化
|
||
v = vals_to_vets([0, 1, 2, 3, 4, 5, 6])
|
||
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]],
|
||
]
|
||
graph = GraphAdjList(edges)
|
||
print("\n初期化後、グラフは")
|
||
graph.print()
|
||
|
||
# 深さ優先探索
|
||
res = graph_dfs(graph, v[0])
|
||
print("\n深さ優先探索（DFS）の頂点順序は")
|
||
print(vets_to_vals(res))
|