Merge pull request #78 from AlgoLeadMe/22-alstjr7437

22-alstjr7437

alstjr7437/BFS/연결-요소의-개수.swift

@@ -0,0 +1,44 @@
+import Foundation
+
+let input = readLine()!.split(separator:
+                            " ").map{ Int($0)!}
+
+let n = input[0] , m = input[1]
+
+var graph : [[Int]] = Array(repeating: [], count: n + 1)
+var visited : [Bool] = Array(repeating: false, count: n + 1)
+var result : Int = 0
+
+for _ in 0..<m {
+    let tmp = readLine()!.split(separator: " ").map { Int($0)!}
+    graph[tmp[0]].append(tmp[1])
+    graph[tmp[1]].append(tmp[0])
+}
+
+func bfs(start: Int){
+    visited[start] = true
+    var queue: [Int] = [start]
+
+    var idx : Int = 0
+
+    while idx < queue.count{
+        let current = queue[idx]
+
+        idx += 1
+        for i in graph[current]{
+            if visited[i] == false {
+                queue.append(i)
+                visited[i] = true
+            }
+        }
+    }
+}
+
+for i in 1...n{
+    if visited[i] == false {
+        bfs(start : i)
+        result += 1
+    }
+}
+
+print(result)

alstjr7437/README.md

@@ -22,4 +22,5 @@
 | 18차시 | 2024.03.23 |  다익스트라  | <a href="https://www.acmicpc.net/problem/1753">최단 경로</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/66 |
 | 19차시 | 2024.03.27 |  문자열  | <a href="https://www.acmicpc.net/problem/5525">IOIOI</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/67 |
 | 20차시 | 2024.04.03 |  BFS  | <a href="https://www.acmicpc.net/problem/1697">숨바꼭질</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/70 |
-| 21차시 | 2024.04.06 |  비트마스킹  | <a href="https://www.acmicpc.net/problem/11723">집합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/74 |
+| 21차시 | 2024.04.06 |  비트마스킹  | <a href="https://www.acmicpc.net/problem/11723">집합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/74 |
+| 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |