COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
09/29/04 17:30:04 (17 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/lp
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/lp/lp_solver_wrapper.h

    r888 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_LP_SOLVER_WRAPPER_H
    3 #define HUGO_LP_SOLVER_WRAPPER
     2#ifndef LEMON_LP_SOLVER_WRAPPER_H
     3#define LEMON_LP_SOLVER_WRAPPER
    44
    55///\ingroup misc
     
    2121
    2222//#include <sage_graph.h>
    23 //#include <hugo/list_graph.h>
    24 //#include <hugo/graph_wrapper.h>
    25 #include <hugo/invalid.h>
     23//#include <lemon/list_graph.h>
     24//#include <lemon/graph_wrapper.h>
     25#include <lemon/invalid.h>
    2626//#include <bfs_dfs.h>
    2727//#include <stp.h>
    28 //#include <hugo/max_flow.h>
     28//#include <lemon/max_flow.h>
    2929//#include <augmenting_flow.h>
    3030//#include <iter_map.h>
     
    3434using std::endl;
    3535
    36 namespace hugo {
     36namespace lemon {
    3737
    3838 
     
    4545  /// stl vector, the range is partitioned into sets and each set is
    4646  /// doubly linked in a list.
    47   /// That is, each class is iterable by hugo iterators, and any member of
     47  /// That is, each class is iterable by lemon iterators, and any member of
    4848  /// the vector can bo moved to an other class.
    4949  template <typename T>
     
    6464    /// The classes are indexed by integers from \c 0 to \c classNum()-1.
    6565    int classNum() const { return tips.size(); }
    66     /// This hugo style iterator iterates through a class.
     66    /// This lemon style iterator iterates through a class.
    6767    class ClassIt;
    6868    /// Constructor. The number of classes is to be given which is fixed
     
    158158  /// \brief Wrappers for LP solvers
    159159  ///
    160   /// This class implements a hugo wrapper for glpk.
    161   /// Later other LP-solvers will be wrapped into hugo.
     160  /// This class implements a lemon wrapper for glpk.
     161  /// Later other LP-solvers will be wrapped into lemon.
    162162  /// The aim of this class is to give a general surface to different
    163163  /// solvers, i.e. it makes possible to write algorithms using LP's,
     
    425425  /// @}
    426426
    427 } //namespace hugo
    428 
    429 #endif //HUGO_LP_SOLVER_WRAPPER_H
     427} //namespace lemon
     428
     429#endif //LEMON_LP_SOLVER_WRAPPER_H
  • src/work/marci/lp/max_flow_by_lp.cc

    r764 r921  
    44
    55#include <sage_graph.h>
    6 #include <hugo/smart_graph.h>
    7 #include <hugo/dimacs.h>
    8 #include <hugo/time_measure.h>
     6#include <lemon/smart_graph.h>
     7#include <lemon/dimacs.h>
     8#include <lemon/time_measure.h>
    99//#include <graph_wrapper.h>
    10 #include <hugo/max_flow.h>
     10#include <lemon/max_flow.h>
    1111#include <augmenting_flow.h>
    1212//#include <preflow_res.h>
     
    1414#include <lp_solver_wrapper.h>
    1515
    16 using namespace hugo;
     16using namespace lemon;
    1717
    1818// Use a DIMACS max flow file as stdin.
Note: See TracChangeset for help on using the changeset viewer.