最简单的DFS(深度优先搜索）

夕日坂

已于 2024-01-05 15:56:09 修改

阅读量125

点赞数

分类专栏：经典算法编程文章标签： python

于 2021-09-24 15:47:32 首次发布

本文链接：https://blog.csdn.net/qq_45702174/article/details/120456698

版权

经典算法编程专栏收录该内容

3 篇文章 0 订阅

订阅专栏

graph = {
	"A" : ["B","C"],
	"B" : ["A","C", "D"],
	"C" : ["A","B","D","E"],
	"D" : ["B","C","E","F"],
	"E" : ["C","D"],
	"F" : ["D"]
}
def DFS(graph,s):
	stack = []
	stack.append(s)
	seen = set()
	seen.add(s)
	while(len(stack)>0):
		vertex = stack.pop()
		nodes  = graph[vertex]
		for w in nodes:
			if w not in seen:
				stack.append(w)
				seen.add(w)
		print(vertex)	
		
DFS(graph,"E")