COIN-OR::LEMON - Graph Library

Changeset 921:818510fa3d99 in lemon-0.x for src/lemon/min_cost_flow.h


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

File:
1 moved

Legend:

Unmodified
Added
Removed
  • src/lemon/min_cost_flow.h

    r910 r921  
    11/* -*- C++ -*-
    2  * src/hugo/min_cost_flow.h - Part of HUGOlib, a generic C++ optimization library
     2 * src/lemon/min_cost_flow.h - Part of LEMON, a generic C++ optimization library
    33 *
    44 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     
    1515 */
    1616
    17 #ifndef HUGO_MIN_COST_FLOW_H
    18 #define HUGO_MIN_COST_FLOW_H
     17#ifndef LEMON_MIN_COST_FLOW_H
     18#define LEMON_MIN_COST_FLOW_H
    1919
    2020///\ingroup flowalgs
     
    2323
    2424
    25 #include <hugo/dijkstra.h>
    26 #include <hugo/graph_wrapper.h>
    27 #include <hugo/maps.h>
     25#include <lemon/dijkstra.h>
     26#include <lemon/graph_wrapper.h>
     27#include <lemon/maps.h>
    2828#include <vector>
    2929
    30 namespace hugo {
     30namespace lemon {
    3131
    3232/// \addtogroup flowalgs
     
    3737  ///
    3838  ///
    39   /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
     39  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
    4040  /// an algorithm for finding a flow of value \c k
    4141  /// having minimal total cost
     
    252252  ///@}
    253253
    254 } //namespace hugo
    255 
    256 #endif //HUGO_MIN_COST_FLOW_H
     254} //namespace lemon
     255
     256#endif //LEMON_MIN_COST_FLOW_H
Note: See TracChangeset for help on using the changeset viewer.