Commit 8b7de93

committed

[Silver II] Title: DFS와 BFS, Time: 488 ms, Memory: 32460 KB -BaekjoonHub

1 parent 9413ff0 commit 8b7de93Copy full SHA for 8b7de93

File tree

+48

-0

lines changed

+48

-0

lines changed

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+# DFS와 BFS`
	`2`	`+from collections import deque`
	`3`	`+N, M, V = map(int, input().split())`
	`4`	`+g = [[] for _ in range(N+1)]`
	`5`	`+`
	`6`	`+def bfs(s):`
	`7`	`+ visited = [False] * (N + 1)`
	`8`	`+ visited[s] = True`
	`9`	`+ q = deque([s])`
	`10`	`+ while q:`
	`11`	`+ v = q.popleft()`
	`12`	`+ print(v, end=' ')`
	`13`	`+ for i in g[v]:`
	`14`	`+ if not visited[i]:`
	`15`	`+ q.append(i)`
	`16`	`+ visited[i] = True`
	`17`	`+`
	`18`	`+visited = [False] * (N + 1)`
	`19`	`+def dfs(s):`
	`20`	`+ visited[s] = True`
	`21`	`+ print(s, end=' ')`
	`22`	`+ for i in g[s]:`
	`23`	`+ if not visited[i]:`
	`24`	`+ dfs(i)`
	`25`	`+`
	`26`	`+for i in range(M):`
	`27`	`+ a, b = map(int, input().split())`
	`28`	`+ g[a].append(b)`
	`29`	`+ g[b].append(a)`
	`30`	`+`
	`31`	`+for i in range(1, N+1):`
	`32`	`+ g[i].sort()`
	`33`	`+`
	`34`	`+dfs(V)`
	`35`	`+print("")`
	`36`	`+bfs(V)`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+# [Silver II] DFS와 BFS - 1260`
	`2`	`+`
	`3`	`+[문제 링크](https://www.acmicpc.net/problem/1260)`
	`4`	`+`
	`5`	`+### 성능 요약`
	`6`	`+`
	`7`	`+메모리: 32460 KB, 시간: 488 ms`
	`8`	`+`
	`9`	`+### 분류`
	`10`	`+`
	`11`	`+너비 우선 탐색(bfs), 깊이 우선 탐색(dfs), 그래프 이론(graphs), 그래프 탐색(graph_traversal)`
	`12`	`+`

Comments

(0)