Merge pull request #46 from AlgoLeadMe/13-kangrae-jo

13-kangrae-jo

kangrae-jo/Graph/13-kangrae-jo.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+#include <list>
+#include <vector>
+
+using namespace std;
+
+int N, M;
+vector<bool> visited;
+vector<list<int>> graph;
+
+void dfs(int v, list<int>& r) {
+    visited[v] = true;
+    for (int x : graph[v]) {
+        if (visited[x] == false) dfs(x, r);
+    }
+    r.push_front(v);
+}
+
+list<int> topologicalSort() {
+    list<int> r;
+    for (int v = 1; v <= N; v++) {
+        if (visited[v] == false) dfs(v, r);
+    }
+
+    return r;
+}
+
+int main() {
+    cin >> N >> M;
+
+    visited = vector<bool>(N + 1, false);
+    graph = vector<list<int>>(N + 1);
+
+    while (M--) {
+        int a, b;
+        cin >> a >> b;
+
+        graph[a].push_back(b);
+    }
+
+    list<int> r = topologicalSort();
+    for (int i : r) {
+        cout << i << " ";
+    }
+
+    return 0;
+}

kangrae-jo/README.md

@@ -14,5 +14,6 @@
 | 10차시 | 2024.11.30 |  누적합  | [구간 합 구하기 4](https://www.acmicpc.net/problem/11659)|[#37](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/37)|
 | 11차시 | 2024.12.21 |  Greedy  | [ATM](https://www.acmicpc.net/problem/11399)|[#41](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/41)|
 | 12차시 | 2024.12.24 |  HEAP  | [크리스마스 선물](https://www.acmicpc.net/problem/14235)|[#44](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/44)|
+| 13차시 | 2024.12.28 |  Graph  | [줄 세우기](https://www.acmicpc.net/problem/2252)|[#46](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/46)|
 
 ---