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

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

Location:

src/work/marci/leda

Files:

• bipartite_matching_comparison.cc (modified) (5 diffs)
• bipartite_matching_leda.cc (modified) (2 diffs)
• bipartite_matching_leda_gen.cc (modified) (4 diffs)
• leda_graph_wrapper.h (modified) (5 diffs)
• max_bipartite_matching_demo.cc (modified) (1 diff)

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: " 

src/work/marci/leda/bipartite_matching_leda.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>
 
 /**
@@ -43 +43 @@
 }
 
-using namespace hugo;
+using namespace lemon;
 
 int main() {

src/work/marci/leda/bipartite_matching_leda_gen.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>
 #include <augmenting_flow.h>
 
@@ -44 +44 @@
 }
 
-using namespace hugo;
+using namespace lemon;
 
 int main() {
@@ -111 +111 @@
     max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
   max_flow_test.run();
-  std::cout << "HUGO max matching algorithm based on preflow." << std::endl 
+  std::cout << "LEMON max matching algorithm based on preflow." << std::endl 
             << "Size of matching: " 
             << max_flow_test.flowValue() << std::endl;
@@ -130 +130 @@
     max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
   while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
-  std::cout << "HUGO max matching algorithm based on blocking flow augmentation." 
+  std::cout << "LEMON max matching algorithm based on blocking flow augmentation." 
             << std::endl << "Matching size: " 
             << max_flow_test_1.flowValue() << std::endl;

src/work/marci/leda/leda_graph_wrapper.h

@@ -1 +1 @@
 // -*- c++ -*-
-#ifndef HUGO_LEDA_GRAPH_WRAPPER_H
-#define HUGO_LEDA_GRAPH_WRAPPER_H
+#ifndef LEMON_LEDA_GRAPH_WRAPPER_H
+#define LEMON_LEDA_GRAPH_WRAPPER_H
 
 #include <LEDA/graph.h>
@@ -15 +15 @@
 //#endif
 
-#include <hugo/invalid.h>
-
-namespace hugo {
-
-  /// \brief A graph wrapper structure for wrapping LEDA graphs in HUGO.
+#include <lemon/invalid.h>
+
+namespace lemon {
+
+  /// \brief A graph wrapper structure for wrapping LEDA graphs in LEMON.
   ///
   /// This graph wrapper class wraps LEDA graphs and LEDA parametrized graphs
-  /// to satisfy HUGO graph concepts.
-  /// Then the generic HUGOlib algorithms and wrappers can be used 
+  /// to satisfy LEMON graph concepts.
+  /// Then the generic LEMON algorithms and wrappers can be used 
   /// with LEDA graphs. 
   /// \ingroup gwrapper
@@ -299 +299 @@
 
     /// This class is to wrap existing 
-    /// LEDA node-maps to HUGO ones.
+    /// LEDA node-maps to LEMON ones.
     template<typename T> class NodeMapWrapper
     {
@@ -321 +321 @@
 
     /// This class is to wrap existing 
-    /// LEDA edge-maps to HUGO ones.
+    /// LEDA edge-maps to LEMON ones.
     template<typename T> class EdgeMapWrapper
     {
@@ -380 +380 @@
   };
 
-} //namespace hugo
-
-#endif // HUGO_LEDA_GRAPH_WRAPPER_H
+} //namespace lemon
+
+#endif // LEMON_LEDA_GRAPH_WRAPPER_H

src/work/marci/leda/max_bipartite_matching_demo.cc

@@ -37 +37 @@
 }
 
-using namespace hugo;
+using namespace lemon;
 
 using std::cout;