From 6412e55d71c9a9699a16a05cc9ee107fcb1d7c74 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Sun, 24 Aug 2025 13:52:17 +0900
Subject: [PATCH] =?UTF-8?q?[20250824]=20BOJ=20/=20G4=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EB=B6=84=20=EA=B7=B8=EB=9E=98=ED=94=84=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \352\267\270\353\236\230\355\224\204.md" | 75 +++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 "JHLEE325/202508/24 BOJ G4 \354\235\264\353\266\204 \352\267\270\353\236\230\355\224\204.md"

diff --git "a/JHLEE325/202508/24 BOJ G4 \354\235\264\353\266\204 \352\267\270\353\236\230\355\224\204.md" "b/JHLEE325/202508/24 BOJ G4 \354\235\264\353\266\204 \352\267\270\353\236\230\355\224\204.md"
new file mode 100644
index 00000000..00568b37
--- /dev/null
+++ "b/JHLEE325/202508/24 BOJ G4 \354\235\264\353\266\204 \352\267\270\353\236\230\355\224\204.md"	
@@ -0,0 +1,75 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static ArrayList<Integer>[] graph;
+    static int[] color;
+    static int v, e;
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        StringBuilder sb = new StringBuilder();
+        int T = Integer.parseInt(br.readLine());
+
+        for (int t = 0; t < T; t++) {
+            st = new StringTokenizer(br.readLine());
+            v = Integer.parseInt(st.nextToken());
+            e = Integer.parseInt(st.nextToken());
+
+            graph = new ArrayList[v + 1];
+            for (int i = 1; i <= v; i++) graph[i] = new ArrayList<>();
+
+            for (int i = 0; i < e; i++) {
+                st = new StringTokenizer(br.readLine());
+                int a = Integer.parseInt(st.nextToken());
+                int b = Integer.parseInt(st.nextToken());
+                graph[a].add(b);
+                graph[b].add(a);
+            }
+
+            color = new int[v + 1];
+            boolean ok = true;
+
+            for (int i = 1; i <= v && ok; i++) {
+                if (color[i] == 0) {
+                    ok = bfs(i);
+                }
+            }
+
+            if(ok){
+                sb.append("YES\n");
+            }
+            else{
+                sb.append("NO\n");
+            }
+        }
+
+        System.out.print(sb.toString());
+    }
+
+    static boolean bfs(int s) {
+        ArrayDeque<Integer> q = new ArrayDeque<>();
+        color[s] = 1;
+        q.offer(s);
+
+        while (!q.isEmpty()) {
+            int u = q.poll();
+            int nextColor = -color[u];
+
+            for (int v : graph[u]) {
+                if (color[v] == 0) {
+                    color[v] = nextColor;
+                    q.offer(v);
+                } else if (color[v] == color[u]) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+}
+
+```