From 2d99bc5b8b24ca1482a9a8d8fc3ab6b1b7711c3c Mon Sep 17 00:00:00 2001
From: Donew <47556347+03do-new30@users.noreply.github.com>
Date: Thu, 13 Mar 2025 20:24:24 +0900
Subject: [PATCH] =?UTF-8?q?[20250313]=20BOJ=20/=20G3=20/=20=EC=A4=84=20?=
 =?UTF-8?q?=EC=84=B8=EC=9A=B0=EA=B8=B0=20/=20=EC=8B=A0=EB=8F=99=EC=9C=A4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \354\204\270\354\232\260\352\270\260.md" | 67 +++++++++++++++++++
 1 file changed, 67 insertions(+)
 create mode 100644 "03do-new30/202503/13 BOJ G3 \354\244\204 \354\204\270\354\232\260\352\270\260.md"

diff --git "a/03do-new30/202503/13 BOJ G3 \354\244\204 \354\204\270\354\232\260\352\270\260.md" "b/03do-new30/202503/13 BOJ G3 \354\244\204 \354\204\270\354\232\260\352\270\260.md"
new file mode 100644
index 00000000..fba2c745
--- /dev/null
+++ "b/03do-new30/202503/13 BOJ G3 \354\244\204 \354\204\270\354\232\260\352\270\260.md"	
@@ -0,0 +1,67 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+    static int N, M;
+    static List<Integer>[] graph;
+    static int[] indegree;
+    public static void main(String[] args) throws IOException {
+        input();
+        getIndegree();
+        List<Integer> order = topologySort();
+        for (int num : order) {
+            System.out.print(num + " ");
+        }
+        System.out.println();
+    }
+
+    static ArrayList<Integer> topologySort() {
+        ArrayList<Integer> orderList = new ArrayList<>(); // 정점의 방문 순서
+        Queue<Integer> q = new ArrayDeque<>();
+        for (int i = 1; i < N+1; i++) {
+            if (indegree[i] == 0) {
+                q.offer(i);
+            }
+        }
+
+        while (!q.isEmpty()) {
+            int node = q.poll();
+            orderList.add(node);
+            for (int next : graph[node]) {
+                if (--indegree[next] == 0) q.offer(next);
+            }
+        }
+        return orderList;
+    }
+
+    static void getIndegree() {
+        indegree = new int[N+1];
+        for (int from = 1; from < N+1; from++) {
+            for (int to : graph[from] ){
+                // 진입 차수 기록
+                indegree[to]++;
+            }
+        }
+    }
+
+    static void input() throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        graph = new List[N+1];
+        for (int i = 1; i < N+1; i++) {
+            graph[i] = new ArrayList<>();
+        }
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            graph[a].add(b);
+        }
+        br.close();
+
+    }
+}
+```