graph={
'A':set(['B','C']),
'B':set(['A','D','E']),
'C':set(['A','F']),
'D':set(['B']),
'E':set(['B','F']),
'F':set(['C','E'])}
def dfs(graph, start):
visited, stack = set(), [start]
while stack:
vertex = stack.pop()
if vertex not in visited:
visited.add(vertex)
stack.extend(graph[vertex] - visited)
return visited
dfs(graph, 'A')
任何人都可以解释为什么我们使用这些这是使用Python实现的DFS搜索我从网上采取
visited,stack = set(), [start]
graph[vertex] - visited
stack.extend(graph[vertex] - visited)
你了解(语言不可知)DFS算法吗? – BallpointBen