๐Ÿ“š Problem Solving/BFS & DFS

๐Ÿ“š๋ฌธ์ œโœ๏ธํ’€์ด (Python3)๋ฌธ์ œ๋ฅผ ํ†ตํ•ด BFS, DFS ๊ฐœ๋…์„ ์ •ํ™•ํ•˜๊ฒŒ ์ดํ•ดํ•˜๊ณ ์ž ๋„์‹ํ™”ํ•˜์—ฌ ํ’€์ดํ•˜์˜€์Šต๋‹ˆ๋‹ค.์ฃผ์–ด์ง„ ์กฐ๊ฑด์€ ๋ฐฉ๋ฌธ ๊ฐ€๋Šฅํ•œ ์ •์ ์ด ์—ฌ๋Ÿฌ ๊ฐœ์ผ ๋•, ์ •์  ๋ฒˆํ˜ธ๊ฐ€ ์ž‘์€ ๊ฒƒ ๋จผ์ € ๋ฐฉ๋ฌธํ•˜๋Š” ๊ฒƒ์ด์—ˆ์Šต๋‹ˆ๋‹ค. from collections import dequeimport sys# 0. ์ž…๋ ฅ ๋ฐ ์ดˆ๊ธฐํ™”input = sys.stdin.readlineN, M, start = map(int, input().split())graph = [[] for _ in range(N+1)]# 1. graph ์ •๋ณด ์ž…๋ ฅ: ๊ฐ„์„  ๋Œ๋ฉด์„œ ์—ฐ๊ฒฐ ์ •๋ณด๋ฅผ graph์— ๋„ฃ์–ด์คŒfor _ in range(M): s, e = map(int, input().split()) # ์–‘๋ฐฉํ–ฅ ๊ทธ๋ž˜ํ”„ graph[s].append(e..
์ž„์ฉจ์ด
'๐Ÿ“š Problem Solving/BFS & DFS' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๊ธ€ ๋ชฉ๋ก