COIN-OR::LEMON - Graph Library

Changeset 921:818510fa3d99 in lemon-0.x for src/work/athos/mincostflow.h


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

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/mincostflow.h

    r672 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINCOSTFLOW_H
    3 #define HUGO_MINCOSTFLOW_H
     2#ifndef LEMON_MINCOSTFLOW_H
     3#define LEMON_MINCOSTFLOW_H
    44
    55///\ingroup galgs
     
    77///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
    88
    9 #include <hugo/dijkstra.h>
    10 #include <hugo/graph_wrapper.h>
    11 #include <hugo/maps.h>
     9#include <lemon/dijkstra.h>
     10#include <lemon/graph_wrapper.h>
     11#include <lemon/maps.h>
    1212#include <vector>
    1313#include <list>
    1414#include <values.h>
    15 #include <hugo/for_each_macros.h>
    16 #include <hugo/unionfind.h>
    17 #include <hugo/bin_heap.h>
     15#include <lemon/for_each_macros.h>
     16#include <lemon/unionfind.h>
     17#include <lemon/bin_heap.h>
    1818#include <bfs_dfs.h>
    1919
    20 namespace hugo {
     20namespace lemon {
    2121
    2222/// \addtogroup galgs
     
    2727  ///
    2828  ///
    29   /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
     29  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
    3030  /// an algorithm for solving the following general minimum cost flow problem>
    3131  ///
     
    509509  ///@}
    510510
    511 } //namespace hugo
    512 
    513 #endif //HUGO_MINCOSTFLOW_H
     511} //namespace lemon
     512
     513#endif //LEMON_MINCOSTFLOW_H
Note: See TracChangeset for help on using the changeset viewer.