(第2讲)
https://www.youtube.com/watch?v=bD8RT0ub--0www.youtube.com![v2-1bbc3c5ab37b83a279675c647ccac7d2_b.jpg](http://img-02.proxy.5ce.com/view/image?&type=2&guid=4e8950a6-382a-eb11-8da9-e4434bdf6706&url=https://pic3.zhimg.com/v2-1bbc3c5ab37b83a279675c647ccac7d2_b.jpg)
上述图可以用一个字典表示:
graph={'A':['B','C'],
'B':['A','C','D'],
'C':['A','B','D','E'],
'D':['B','C','E','F'],
'E':['D','C'],
'F':['D']}
下面分别是广度优先遍历和深度优先遍历的代码:
def
其中涉及了队列、栈、字典、列表、集合的基本用法,需要掌握。
下面一篇文章也不错,分享给大家:
爱知识的lz:LeetCode | 一文帮你搞定BFS、DFS算法(python版)zhuanlan.zhihu.com![v2-f143387436758059946244871f59dea2_180x120.jpg](http://img-02.proxy.5ce.com/view/image?&type=2&guid=4e8950a6-382a-eb11-8da9-e4434bdf6706&url=https://pic3.zhimg.com/v2-f143387436758059946244871f59dea2_180x120.jpg)
![v2-2b71035099dd106c03df4c62c1262d60_ipico.jpg](http://img-01.proxy.5ce.com/view/image?&type=2&guid=4e8950a6-382a-eb11-8da9-e4434bdf6706&url=https://pic1.zhimg.com/v2-2b71035099dd106c03df4c62c1262d60_ipico.jpg)