COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
09/29/04 17:30:04 (16 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:
5 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/leda/bipartite_matching_comparison.cc

    r771 r921  
    1414//#include <smart_graph.h>
    1515//#include <dimacs.h>
    16 #include <hugo/time_measure.h>
     16#include <lemon/time_measure.h>
    1717#include <for_each_macros.h>
    18 #include <hugo/graph_wrapper.h>
     18#include <lemon/graph_wrapper.h>
    1919#include <bipartite_graph_wrapper.h>
    20 #include <hugo/maps.h>
    21 #include <hugo/max_flow.h>
     20#include <lemon/maps.h>
     21#include <lemon/max_flow.h>
    2222
    2323using std::cin;
     
    2525using std::endl;
    2626
    27 using namespace hugo;
     27using namespace lemon;
    2828
    2929int main() {
     
    9292    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    9393  max_flow_test.run();
    94   cout << "HUGO max matching algorithm based on preflow." << endl
     94  cout << "LEMON max matching algorithm based on preflow." << endl
    9595            << "Size of matching: "
    9696            << max_flow_test.flowValue() << endl;
     
    108108//   typedef SageGraph MutableGraph;
    109109//   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
    110 //   cout << "HUGO max matching algorithm based on blocking flow augmentation."
     110//   cout << "LEMON max matching algorithm based on blocking flow augmentation."
    111111//          << endl << "Matching size: "
    112112//          << max_flow_test.flowValue() << endl;
     
    142142    max_flow_test(hg, s, t, cm, flow);
    143143  max_flow_test.run();
    144   cout << "HUGO max matching algorithm on SageGraph by copying the graph, based on preflow."
     144  cout << "LEMON max matching algorithm on SageGraph by copying the graph, based on preflow."
    145145            << endl
    146146            << "Size of matching: "
  • src/work/marci/leda/bipartite_matching_leda.cc

    r769 r921  
    1414//#include <smart_graph.h>
    1515//#include <dimacs.h>
    16 #include <hugo/time_measure.h>
     16#include <lemon/time_measure.h>
    1717#include <for_each_macros.h>
    18 #include <hugo/graph_wrapper.h>
     18#include <lemon/graph_wrapper.h>
    1919#include <bipartite_graph_wrapper.h>
    20 #include <hugo/maps.h>
    21 #include <hugo/max_flow.h>
     20#include <lemon/maps.h>
     21#include <lemon/max_flow.h>
    2222
    2323/**
     
    4343}
    4444
    45 using namespace hugo;
     45using namespace lemon;
    4646
    4747int main() {
  • src/work/marci/leda/bipartite_matching_leda_gen.cc

    r769 r921  
    1414//#include <smart_graph.h>
    1515//#include <dimacs.h>
    16 #include <hugo/time_measure.h>
     16#include <lemon/time_measure.h>
    1717#include <for_each_macros.h>
    18 #include <hugo/graph_wrapper.h>
     18#include <lemon/graph_wrapper.h>
    1919#include <bipartite_graph_wrapper.h>
    20 #include <hugo/maps.h>
    21 #include <hugo/max_flow.h>
     20#include <lemon/maps.h>
     21#include <lemon/max_flow.h>
    2222#include <augmenting_flow.h>
    2323
     
    4444}
    4545
    46 using namespace hugo;
     46using namespace lemon;
    4747
    4848int main() {
     
    111111    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    112112  max_flow_test.run();
    113   std::cout << "HUGO max matching algorithm based on preflow." << std::endl
     113  std::cout << "LEMON max matching algorithm based on preflow." << std::endl
    114114            << "Size of matching: "
    115115            << max_flow_test.flowValue() << std::endl;
     
    130130    max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
    131131  while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
    132   std::cout << "HUGO max matching algorithm based on blocking flow augmentation."
     132  std::cout << "LEMON max matching algorithm based on blocking flow augmentation."
    133133            << std::endl << "Matching size: "
    134134            << max_flow_test_1.flowValue() << std::endl;
  • src/work/marci/leda/leda_graph_wrapper.h

    r650 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_LEDA_GRAPH_WRAPPER_H
    3 #define HUGO_LEDA_GRAPH_WRAPPER_H
     2#ifndef LEMON_LEDA_GRAPH_WRAPPER_H
     3#define LEMON_LEDA_GRAPH_WRAPPER_H
    44
    55#include <LEDA/graph.h>
     
    1515//#endif
    1616
    17 #include <hugo/invalid.h>
    18 
    19 namespace hugo {
    20 
    21   /// \brief A graph wrapper structure for wrapping LEDA graphs in HUGO.
     17#include <lemon/invalid.h>
     18
     19namespace lemon {
     20
     21  /// \brief A graph wrapper structure for wrapping LEDA graphs in LEMON.
    2222  ///
    2323  /// This graph wrapper class wraps LEDA graphs and LEDA parametrized graphs
    24   /// to satisfy HUGO graph concepts.
    25   /// Then the generic HUGOlib algorithms and wrappers can be used
     24  /// to satisfy LEMON graph concepts.
     25  /// Then the generic LEMON algorithms and wrappers can be used
    2626  /// with LEDA graphs.
    2727  /// \ingroup gwrapper
     
    299299
    300300    /// This class is to wrap existing
    301     /// LEDA node-maps to HUGO ones.
     301    /// LEDA node-maps to LEMON ones.
    302302    template<typename T> class NodeMapWrapper
    303303    {
     
    321321
    322322    /// This class is to wrap existing
    323     /// LEDA edge-maps to HUGO ones.
     323    /// LEDA edge-maps to LEMON ones.
    324324    template<typename T> class EdgeMapWrapper
    325325    {
     
    380380  };
    381381
    382 } //namespace hugo
    383 
    384 #endif // HUGO_LEDA_GRAPH_WRAPPER_H
     382} //namespace lemon
     383
     384#endif // LEMON_LEDA_GRAPH_WRAPPER_H
  • src/work/marci/leda/max_bipartite_matching_demo.cc

    r771 r921  
    3737}
    3838
    39 using namespace hugo;
     39using namespace lemon;
    4040
    4141using std::cout;
Note: See TracChangeset for help on using the changeset viewer.