[英]How to convert this BFS code to DFS and UCS using stack implementation..?
這是一個使用隊列 G1 的 BFS 代碼:來自 collections 的頂點導入雙端隊列,我想使用堆棧而不是隊列從這個 BFS 代碼實現 DFS 和 UCS 代碼。 請幫我處理這段代碼。
graph={ 'a': set(['b','c']),
'b': set(['a','d']),
'c': set(['a','d','f']),
'd': set(['b','c','e','s']),
'e': set(['d','h','s','r']),
'f': set(['G','c','r']),
'G': set(['f']),
'h': set(['e','p','q']),
'p': set(['s','q','h']),
'q': set(['p','h']),
'r': set(['e','f']),
's': set(['d','e','p'])}
def bfs(graph, start,goal):
visited= []
path=[]
queue=deque([start])
while queue:
vertex= queue.popleft()
if vertex not in path:
path.extend(vertex)
visited.extend(vertex)
queue.extend(list(set(graph[vertex])))
if goal in path:
return (path,visited)
checker=1
for a in graph:
for b in graph[a]:
if b in path:
checker=(checker)*(1)
else:
checker=(checker)*(0)
if(checker>0):
if a not in visited:
visited.extend(a)
return (path,visited)
p=[]
p.extend(bfs(graph,'s','G'))
print("path :",p[0])
print("visited nodes:",p[1])
代替
queue=deque([start])
和
queue=[start] # just a list
和
vertex = queue.popleft()
和
vertex= queue.pop(-1) # like a stack, pop the last item from the list
output 變為:
path : ['s', 'd', 'b', 'a', 'c', 'f', 'r', 'e', 'h', 'p', 'q', 'G']
visited nodes: ['s', 'd', 'b', 'a', 'c', 'f', 'r', 'e', 'h', 'p', 'q', 'G']
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.