DFSとBFSの実装例
BFS(幅優先探索)とDFS(深さ優先探索)の実装例
code:python
def dfs(G, v):
seen = False * len(G)
q = deque(v)
seenv = True
while q:
v = q.pop()
for u in Gv:
if not seenu:
seenu = True
q.append(u)
def bfs(G, v):
seen = False * len(G)
q = deque(v)
seenv = True
while q:
v = q.popleft()
for u in Gv:
if not seenu:
seenu = True
q.append(u)