Changeset 931:9227ecd7b0bc in lemon-0.x for src/demo/sub_graph_wrapper_demo.cc

Timestamp:

09/30/04 19:32:00 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1253

Message:

SubGraphWrapper? code example, converter from dimacs to graphviz dot file.
The second one can be a tool for generating documentation of code examples.

File:

• src/demo/sub_graph_wrapper_demo.cc (modified) (3 diffs)

src/demo/sub_graph_wrapper_demo.cc

@@ -15 +15 @@
 #include <lemon/dimacs.h>
 #include <lemon/preflow.h>
-#include <lemon/tight_edge_filter_map.h>
+#include <tight_edge_filter_map.h>
 
 using namespace lemon;
@@ -38 +38 @@
   readDimacs(std::cin, g, length, s, t);
 
-  cout << "edges with lengths (of form tail--length->head): " << endl;
+  cout << "edges with lengths (of form id, tail--length->head): " << endl;
   for(EdgeIt e(g); e!=INVALID; ++e) 
-    cout << " " << g.id(g.tail(e)) << "--" 
+    cout << " " << g.id(e) << ", " << g.id(g.tail(e)) << "--" 
          << length[e] << "->" << g.id(g.head(e)) << endl;
 
@@ -68 +68 @@
   preflow.run();
 
+  cout << "maximum number of edge-disjoint shortest path: " 
+       << preflow.flowValue() << endl;
   cout << "edges of the maximum number of edge-disjoint shortest s-t paths: " 
        << endl;
   for(EdgeIt e(g); e!=INVALID; ++e) 
     if (flow[e])
-      cout << " " << g.id(g.tail(e)) << "--" 
+      cout << " " << g.id(e) << ", "
+           << g.id(g.tail(e)) << "--" 
            << length[e] << "->" << g.id(g.head(e)) << endl;
-
-  return 0;
 }