27 lines
583 B
Python
27 lines
583 B
Python
from collections import deque
|
|
|
|
def solution(n, edge):
|
|
graph = [[] for _ in range(n+1)]
|
|
|
|
for u, v in edge :
|
|
graph[u].append(v)
|
|
graph[v].append(u)
|
|
|
|
dist = [-1] * (n + 1)
|
|
dist[1] = 0
|
|
|
|
qu = deque([1])
|
|
|
|
while qu :
|
|
curr = qu.popleft()
|
|
|
|
for nxt in graph[curr] :
|
|
if dist[nxt] == -1 :
|
|
dist[nxt] = dist[curr] + 1
|
|
qu.append(nxt)
|
|
|
|
return dist.count(max(dist))
|
|
|
|
n = 6
|
|
vertex = [[3, 6], [4, 3], [3, 2], [1, 3], [1, 2], [2, 4], [5, 2]]
|
|
print(solution(n, vertex)) |