Changeset 921:818510fa3d99 in lemon-0.x for src/work/marci/leda/bipartite_matching_comparison.cc

Timestamp:

09/29/04 17:30:04 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

hugo -> lemon

File:

• src/work/marci/leda/bipartite_matching_comparison.cc (modified) (5 diffs)

src/work/marci/leda/bipartite_matching_comparison.cc

@@ -14 +14 @@
 //#include <smart_graph.h>
 //#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
 #include <for_each_macros.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
 #include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
 
 using std::cin;
@@ -25 +25 @@
 using std::endl;
 
-using namespace hugo;
+using namespace lemon;
 
 int main() {
@@ -92 +92 @@
     max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
   max_flow_test.run();
-  cout << "HUGO max matching algorithm based on preflow." << endl 
+  cout << "LEMON max matching algorithm based on preflow." << endl 
             << "Size of matching: " 
             << max_flow_test.flowValue() << endl;
@@ -108 +108 @@
 //   typedef SageGraph MutableGraph;
 //   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
-//   cout << "HUGO max matching algorithm based on blocking flow augmentation." 
+//   cout << "LEMON max matching algorithm based on blocking flow augmentation." 
 //          << endl << "Matching size: " 
 //          << max_flow_test.flowValue() << endl;
@@ -142 +142 @@
     max_flow_test(hg, s, t, cm, flow);
   max_flow_test.run();
-  cout << "HUGO max matching algorithm on SageGraph by copying the graph, based on preflow." 
+  cout << "LEMON max matching algorithm on SageGraph by copying the graph, based on preflow." 
             << endl 
             << "Size of matching: "