鍦≒ython涓疄鐜板箍搴︿紭鍏堢畻娉曞彲浠ラ€氳繃浣跨敤闃熷垪鏉ュ疄鐜般€備互涓嬫槸涓€涓ず渚嬩唬鐮侊紝瀹炵幇浜嗕竴涓畝鍗曠殑骞垮害浼樺厛鎼滅储绠楁硶锛?/p>

from collections import deque

def bfs(graph, start):
    visited = set()
    queue = deque([start])

    while queue:
        node = queue.popleft()
        if node not in visited:
            print(node)
            visited.add(node)
            queue.extend(graph[node] - visited)

# 瀹氫箟涓€涓畝鍗曠殑鍥?/span>
graph = {
    'A': {'B', 'C'},
    'B': {'A', 'D', 'E'},
    'C': {'A', 'F'},
    'D': {'B'},
    'E': {'B', 'F'},
    'F': {'C', 'E'}
}

# 璋冪敤骞垮害浼樺厛绠楁硶
bfs(graph, 'A')

鍦ㄨ繖涓ず渚嬩腑锛屾垜浠畾涔変簡涓€涓畝鍗曠殑鍥撅紝鐒跺悗璋冪敤 bfs() 鍑芥暟鏉ヨ繘琛屽箍搴︿紭鍏堟悳绱€傚嚱鏁颁細浠庢寚瀹氱殑璧峰鑺傜偣寮€濮嬶紝閫愬眰閬嶅巻鍥句腑鐨勮妭鐐癸紝骞惰緭鍑鸿妭鐐瑰€笺€?/p>

浣犲彲浠ユ牴鎹疄闄呮儏鍐佃嚜瀹氫箟鍥剧殑缁撴瀯鍜岃捣濮嬭妭鐐癸紝鐒跺悗璋冪敤 bfs() 鍑芥暟鏉ユ墽琛屽箍搴︿紭鍏堟悳绱€?/p>