๊ด€๋ฆฌ ๋ฉ”๋‰ด

๐Ÿฆ• ๊ณต๋ฃก์ด ๋˜์ž!

[๋ฐฑ์ค€] Python ๋ฐ”์ด๋Ÿฌ์Šค ๋ณธ๋ฌธ

Development/CodingTest

[๋ฐฑ์ค€] Python ๋ฐ”์ด๋Ÿฌ์Šค

Kirok Kim 2021. 12. 31. 22:10
์ „์ฒด ์ฝ”๋“œ
n=int(input())
e=int(input())
matrix=[[0]*(n+1) for i in range(n+1)]

visited=[False]*(n+1)
a=-1
for i in range(e):
  x,y=map(int,input().split())
  matrix[x][y]=matrix[y][x]=1
def dfs(v):
  global a
  visited[v]=True
  a+=1
  for i in range(1,n+1):
    if not visited[i] and matrix[v][i]==1:
      dfs(i)
  return a
print(dfs(1))

 

์ฝ”๋“œ๋ฆฌ๋ทฐ
## ์ž…๋ ฅ๊ฐ’
n=int(input())
e=int(input())
## ํ–‰๋ ฌ๋กœ ๋งŒ๋“ค๊ธฐ
matrix=[[0]*(n+1) for i in range(n+1)]

visited=[False]*(n+1)
# ์ž์‹ ์˜ ๊ฐ’์„ ์ œ์™ธํ•œ ๊ฐ’์ด๋ผ -1
a=-1
for i in range(e):
  x,y=map(int,input().split())
  # ์–‘๋ฐฉํ–ฅ ํ–‰๋ ฌ
  matrix[x][y]=matrix[y][x]=1
def dfs(v):
  global a
  visited[v]=True
  a+=1
  for i in range(1,n+1):
    if not visited[i] and matrix[v][i]==1:
      dfs(i)
  return a
print(dfs(1))
๋ฐ˜์‘ํ˜•
Comments