BFS/DFS 广度/深度优先搜索 Python
假设a点为起始点
结果为: A BC DE F
graph={ "a":["b","c"],
"b":["a","c","d"],
"c":["a","b","d","e"],
"d":["b","c","e","f"],
"e":["c","d"],
"f":["d"]}
def bfs(graph,s):
flag=[]
flag.append(s)
memory=[]
...
原创
2022-02-03 21:45:05 ·
611 阅读 ·
0 评论