Advertisement
Guest User

Untitled

a guest
Oct 16th, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.69 KB | None | 0 0
  1. import collections
  2.  
  3. def bfs(v):
  4.     d[v],e=0,collections.deque([v])
  5.     while len(exp) != 0:
  6.         a = exp.popleft()
  7.         for i in g[a]:
  8.             if i not in d:
  9.                 d[i]=d[a]+1;exp.append(i)
  10.                
  11. g,d,e,n = {},{},collections.deque(),int(input())
  12. for i in range(n):
  13.     x = input().split()
  14.     for i in x:
  15.         if i not in g:
  16.             g[i]=set()
  17.     g[x[0]].add(x[1]);g[x[0]].add(x[2]);g[x[1]].add(x[0]);g[x[1]].add(x[2]);g[x[2]].add(x[1]);g[x[2]].add(x[0])
  18. if "Isenbaev" in g:
  19.     bfs("Isenbaev")
  20. for i in g:
  21.     if i not in d:
  22.         d[i]='undefined'
  23. for i in sorted(g):
  24.     try:
  25.         print(i,d[i])
  26.     except:
  27.         print(i,"undefined")
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement