Search/BreadthFirstSearch_graph.py

View this file on GitHub
Last update: 1970-01-01 00:00:00+00:00

Code

from collections import deque

def bfs(n: int, g:list, s: int) -> list:
    n = len(g)
    INF = float('inf')
    dist = [INF] * n
    dist[s] = 0
    
    q = deque()
    q.append(s)

    while q:
        prev = q.popleft()
        for nxt in g[prev]:
            if dist[nxt] != INF: continue
            dist[nxt] = dist[prev] + 1
            q.append(nxt)


    return dist

def main() -> None:
    n = int(input())

    g = [[] for _ in range(n)]
    for _ in range(n - 1):
        u, v = map(lambda x: int(x) - 1, input().split())
        g[u].append(v)
        g[v].append(u)

    bfs(0, g)



if __name__ == "__main__":
    main()

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.12.5/x64/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.12.5/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/python.py", line 96, in bundle
    raise NotImplementedError
NotImplementedError