Przejdź do treści

BFS

Opis problemu

Implementacja

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
from typing import List
from queue import Queue

def bfs(graph: List[List[int]], visited: List[bool], node: int):
    q = Queue()
    q.put(node)

    while not q.empty():
        node = q.get()

        if visited[node]:
            continue

        visited[node] = True
        print(node)

        for new_node in graph[node]:
            if not visited[new_node]:
                q.put(new_node)

graph = [
    [1, 6],
    [0, 6, 3, 2],
    [1, 3],
    [2, 1, 6, 4, 5],
    [3, 5],
    [4, 3, 6],
    [0, 1, 3, 5],
]

visited = [False] * len(graph)

bfs(graph, visited, 0)