廣度優先搜尋

演算法 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