有向图广度优先搜索 (BFS for a Graph)

最新推荐文章于 2024-03-05 19:56:46 发布

weixin_34318956

最新推荐文章于 2024-03-05 19:56:46 发布

阅读量1.2k

点赞数 1

文章标签：数据结构与算法 python

原文链接：https://my.oschina.net/redhands/blog/3009348

版权

2019独角兽企业重金招聘Python工程师标准>>>

from collections import defaultdict

class Graph:
    def __init__(self):
        self.graph = defaultdict(list)

    def addEdge(self, u, v):
        self.graph[u].append(v)

    def BFS(self, s):
        visited = [False] * (len(self.graph))

        queue = []
        queue.append(s)
        visited[s] = True

        while queue:
            s = queue.pop(0)
            print(s, end=" ")
            for i in self.graph[s]:
                if visited[i] == False:
                    queue.append(i)
                    visited[i] = True
            print(queue)

g = Graph()
g.addEdge(0, 1)
g.addEdge(0, 2)
g.addEdge(1, 2)
g.addEdge(2, 0)
g.addEdge(2, 3)
g.addEdge(3, 3)
g.BFS(2)
# 2 0 3 1

转载于:https://my.oschina.net/redhands/blog/3009348