1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
| import sys
from collections import deque
n,m,v =map(int,sys.stdin.readline().split())
nodes = [[] for _ in range(n+1)]
check = [False for _ in range(n+1)]
for i in range(m):
node1,node2 = map(int,sys.stdin.readline().split())
nodes[node1].append(node2)
nodes[node2].append(node1)
for i in range(1,n+1):
nodes[i].sort()
def bfs(v):
check[v]=True
q = deque([v])
while q:
node=q.popleft()
print(node,end=' ')
for i in nodes[node]:
if check[i]==False:
q.append(i)
check[i]=True
def dfs(v):
print(v,end=' ')
check[v]=True
for i in nodes[v]:
if not check[i]:
dfs(i)
dfs(v)
check=[False]*(n+1)
print()
bfs(v)
|
