广度优先搜索

算法 BFS(G)

输入图 G

**** G 的顶点边缘和分区的输出标记 ****

    for all u ∈ G.vertices()
        setLabel(u, UNEXPLORED)
    for all e ∈ G.edges()
    setLabel
    (e, UNEXPLORED)
    for all v ∈ G.vertices()
        if getLabel(v) = UNEXPLORED
            BFS(G, v)

https://i.stack.imgur.com/enrF5.jpg

https://i.stack.imgur.com/er6az.jpg

https://i.stack.imgur.com/VBk5F.jpg