COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
09/29/04 17:30:04 (20 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/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
Note: See TracChangeset for help on using the changeset viewer.