COIN-OR::LEMON - Graph Library

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


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/old/minlengthpaths.h

    r607 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINLENGTHPATHS_H
    3 #define HUGO_MINLENGTHPATHS_H
     2#ifndef LEMON_MINLENGTHPATHS_H
     3#define LEMON_MINLENGTHPATHS_H
    44
    55///\ingroup galgs
     
    88
    99#include <iostream>
    10 #include <hugo/dijkstra.h>
    11 #include <hugo/graph_wrapper.h>
    12 #include <hugo/maps.h>
     10#include <lemon/dijkstra.h>
     11#include <lemon/graph_wrapper.h>
     12#include <lemon/maps.h>
    1313#include <vector>
    1414
    1515
    16 namespace hugo {
     16namespace lemon {
    1717
    1818/// \addtogroup galgs
     
    2222  /// of minimal total length
    2323  ///
    24   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
     24  /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements
    2525  /// an algorithm for finding k edge-disjoint paths
    2626  /// from a given source node to a given target node in an
     
    198198  ///@}
    199199
    200 } //namespace hugo
    201 
    202 #endif //HUGO_MINLENGTHPATHS_H
     200} //namespace lemon
     201
     202#endif //LEMON_MINLENGTHPATHS_H
Note: See TracChangeset for help on using the changeset viewer.