PROGRAMMERS 49189: 가장 먼 노드

Link : https://programmers.co.kr/learn/courses/30/lessons/49189

---

Python

from collections import deque
 
INF = int(1e9)
 
 
def solution(n, edge):
    graph = [[] for _ in range(n)]
    que = deque()
    distance = [INF for _ in range(n)]
    visited = [False for _ in range(n)]
    for s, e in edge:
        s -= 1;
        e -= 1
        graph[s].append(e)
        graph[e].append(s)
 
    que.append((0, 0))  # now_pos, now_stack
    while len(que):
        s, ns = que.popleft()
        if visited[s]:
            continue
        visited[s] = True
        for e in graph[s]:
            
            if ns + 1 > distance[e]:
                continue
            distance[e] = ns + 1
            que.append((e, ns + 1))
    distance.pop(0)
    max_dist = max(distance)
 
    return distance.count(max_dist)

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com