백준 1260번 DFS와 BFS

문제 링크: https://www.acmicpc.net/problem/1260

Author: skysign

백준 1260번 DFS와 BFS/main.py

@@ -0,0 +1,55 @@
+import sys
+from typing import List
+
+
+class Vertex:
+    def __init__(self, v):
+        self.v = v
+        self.adjacent: List[int] = []
+
+
+def solve():
+    N, M, V = map(int, sys.stdin.readline().strip().split(' '))
+    vertexes: List[Vertex] = [Vertex(n) for n in range(N + 1)]
+
+    for _ in range(M):
+        fr, to = map(int, sys.stdin.readline().strip().split(' '))
+        vertexes[fr].adjacent.append(to)
+        vertexes[to].adjacent.append(fr)
+
+    for vertex in vertexes:
+        vertex.adjacent.sort()
+
+    answer: List[int] = []
+    answer.append(V)
+    dfs(V, vertexes, answer)
+    answer = map(str, answer)
+    print(' '.join(answer))
+
+    answer: List[int] = []
+    bfs(V, vertexes, answer)
+    answer = map(str, answer)
+    print(' '.join(answer))
+
+
+def dfs(V, vertexes, answer):
+    for v in vertexes[V].adjacent:
+        if v not in answer:
+            answer.append(v)
+            dfs(v, vertexes, answer)
+
+
+def bfs(V, vertexes, answer):
+    queue: List[int] = [V]
+    answer.append(V)
+
+    while queue:
+        V = queue.pop(0)
+        for v in vertexes[V].adjacent:
+            if v not in answer:
+                answer.append(v)
+                queue.append(v)
+
+
+if __name__ == '__main__':
+    solve()

백준 1260번 DFS와 BFS/test1.txt

@@ -0,0 +1,6 @@
+4 5 1
+1 2
+1 3
+1 4
+2 4
+3 4

백준 1260번 DFS와 BFS/test1_answer.txt

@@ -0,0 +1,2 @@
+1 2 4 3
+1 2 3 4

백준 1260번 DFS와 BFS/test2.txt

@@ -0,0 +1,6 @@
+5 5 3
+5 4
+5 2
+1 2
+3 4
+3 1

백준 1260번 DFS와 BFS/test2_answer.txt

@@ -0,0 +1,2 @@
+3 1 2 5 4
+3 1 4 2 5

백준 1260번 DFS와 BFS/test3.txt

@@ -0,0 +1,2 @@
+1000 1 1000
+999 1000

백준 1260번 DFS와 BFS/test3_answer.txt

@@ -0,0 +1,2 @@
+1000 999
+1000 999

백준 1260번 DFS와 BFS/test_main.py

@@ -0,0 +1,29 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')
+
+    def test2_solve(self):
+        self.test_solve('2')
+
+    def test3_solve(self):
+        self.test_solve('3')