Graphviz dump for maxflow, shortestpath

hitonanode · hitonanode · commit 148a088dd690 · 2021-03-14T20:51:13.000+09:00
diff --git a/combinatorial_opt/maxflow.hpp b/combinatorial_opt/maxflow.hpp
@@ -2,7 +2,9 @@
 
 #include <algorithm>
 #include <cassert>
+#include <fstream>
 #include <limits>
+#include <string>
 #include <vector>
 
 // CUT begin
@@ -145,6 +147,19 @@ template <class Cap> struct mf_graph {
         return visited;
     }
 
+    void dump_graphviz(std::string filename = "maxflow") const {
+        std::ofstream ss(filename + ".DOT");
+        ss << "digraph{\n";
+        for (int i = 0; i < _n; i++) {
+            for (const auto &e : g[i]) {
+                if (e.cap > 0) ss << i << "->" << e.to << "[label=" << e.cap << "];\n";
+            }
+        }
+        ss << "}\n";
+        ss.close();
+        return;
+    }
+
     int _n;
     struct _edge {
         int to, rev;
diff --git a/graph/bellman_ford.hpp b/graph/bellman_ford.hpp
diff --git a/graph/shortest_path.hpp b/graph/shortest_path.hpp
@@ -1,9 +1,11 @@
 #pragma once
 #include <cassert>
 #include <deque>
+#include <fstream>
 #include <functional>
 #include <limits>
 #include <queue>
+#include <string>
 #include <utility>
 #include <vector>
 
@@ -160,4 +162,15 @@ template <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -
             }
         }
     }
+
+    void dump_graphviz(std::string filename = "shortest_path") const {
+        std::ofstream ss(filename + ".DOT");
+        ss << "digraph{\n";
+        for (int i = 0; i < V; i++) {
+            for (const auto &e : to[i]) ss << i << "->" << e.first << "[label=" << e.second << "];\n";
+        }
+        ss << "}\n";
+        ss.close();
+        return;
+    }
 };
diff --git a/graph/test/bellman_ford.test.cpp b/graph/test/bellman_ford.test.cpp
@@ -1,35 +1,28 @@
-#include "../bellman_ford.hpp"
 #include "../shortest_path.hpp"
 #include <iostream>
 #include <vector>
 #define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_B"
-
-wedges e;
+using namespace std;
 
 int main() {
     int V, E, r;
     cin >> V >> E >> r;
     ShortestPath<long long> graph(V);
-    e.resize(V);
     for (int i = 0; i < E; i++) {
         int s, t, d;
         cin >> s >> t >> d;
-        e[s].emplace_back(t, d);
         graph.add_edge(s, t, d);
     }
-    vector<long long> ret = bellman_ford(r, e, V);
 
     if (!graph.BellmanFord(r, V + 1)) {
         puts("NEGATIVE CYCLE");
         return 0;
     }
 
     for (int i = 0; i < V; i++) {
-        if (graph.dist[i] >= INF) {
-            assert(ret[i] == INF);
+        if (graph.dist[i] >= 1LL << 50) {
             puts("INF");
         } else {
-            assert(ret[i] == graph.dist[i]);
             printf("%lld\n", graph.dist[i]);
         }
     }
