230718 - programmers

[robert-min]

주요 키워드

• graph

[robert-min]

Find far node

• graph 문제

from collections import defaultdict
from collections import deque
def bfs(start, n):
    Q = deque([start])
    visited = [0] * (n+1)
    visited[1] = 1
    while Q:
        node = Q.popleft()
        for next in graph[node]:
            if not visited[next]:
                visited[next] = visited[node] + 1
                Q.append(next)
    return visited.count(max(visited))

def solution(n, edge):
    global graph
    graph = defaultdict(list)
    for e in edge:
        graph[e[0]].append(e[1])
        graph[e[1]].append(e[0])

    return bfs(1, n)