mv topo

Author: shogo314

.vscode/settings.json

@@ -0,0 +1,53 @@
+{
+    "files.associations": {
+        "array": "cpp",
+        "atomic": "cpp",
+        "bit": "cpp",
+        "*.tcc": "cpp",
+        "cctype": "cpp",
+        "clocale": "cpp",
+        "cmath": "cpp",
+        "compare": "cpp",
+        "concepts": "cpp",
+        "cstdarg": "cpp",
+        "cstddef": "cpp",
+        "cstdint": "cpp",
+        "cstdio": "cpp",
+        "cstdlib": "cpp",
+        "ctime": "cpp",
+        "cwchar": "cpp",
+        "cwctype": "cpp",
+        "deque": "cpp",
+        "set": "cpp",
+        "string": "cpp",
+        "unordered_map": "cpp",
+        "vector": "cpp",
+        "exception": "cpp",
+        "algorithm": "cpp",
+        "functional": "cpp",
+        "iterator": "cpp",
+        "memory": "cpp",
+        "memory_resource": "cpp",
+        "numeric": "cpp",
+        "random": "cpp",
+        "string_view": "cpp",
+        "system_error": "cpp",
+        "tuple": "cpp",
+        "type_traits": "cpp",
+        "utility": "cpp",
+        "initializer_list": "cpp",
+        "iomanip": "cpp",
+        "iosfwd": "cpp",
+        "iostream": "cpp",
+        "istream": "cpp",
+        "limits": "cpp",
+        "new": "cpp",
+        "numbers": "cpp",
+        "ostream": "cpp",
+        "sstream": "cpp",
+        "stdexcept": "cpp",
+        "streambuf": "cpp",
+        "typeinfo": "cpp",
+        "valarray": "cpp"
+    }
+}

cpp/graph_util.hpp

@@ -92,3 +92,28 @@ template <typename Cost = int>
 bool is_tree(const Graph<Cost>& graph) {
     return graph.m == graph.n - 1 && is_connected(graph);
 }
+
+/**
+ * @brief 有向グラフをトポロジカルソートする
+ * @param G トポロジカルソートするグラフ
+ * @return ソートされたノード番号のvector DAGでなければ長さがG.n未満になる
+ */
+template<typename Cost>
+std::vector<int> topological_sort(const Graph<Cost> &G) {
+    std::vector<int> indeg(G.n), sorted;
+    std::queue<int> q;
+    for (int i = 0; i < G.n; i++) {
+        for (int dst : G[i]) indeg[dst]++;
+    }
+    for (int i = 0; i < G.n; i++) {
+        if (!indeg[i]) q.push(i);
+    }
+    while (!q.empty()) {
+        int cur = q.front(); q.pop();
+        for (int dst : G[cur]) {
+            if (!--indeg[dst]) q.push(dst);
+        }
+        sorted.push_back(cur);
+    }
+    return sorted;
+}

test/atcoder-edpc-g.test.cpp

@@ -3,7 +3,7 @@
 #include <iostream>
 #include <algorithm>
 
-#include "../cpp/graph.hpp"
+#include "../cpp/graph_util.hpp"
 
 int main(void){
 
@@ -12,8 +12,8 @@ int main(void){
     Graph G(N);
     G.read(M, -1, false, true);
 
-    std::vector<int> dist(N);
-    for(int x : G.topological_sort()){
+    std::vector<int> dist(N), ord(topological_sort(G));
+    for(int x : ord){
         for(int y : G[x]) dist[y] = std::max(dist[y], dist[x] + 1);
     }
     std::cout << *std::max_element(dist.begin(), dist.end()) << std::endl;