COIN-OR::LEMON - Graph Library

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


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 moved

Legend:

Unmodified
Added
Removed
  • src/lemon/list_graph.h

    r919 r921  
    11/* -*- C++ -*-
    2  * src/hugo/list_graph.h - Part of HUGOlib, a generic C++ optimization library
     2 * src/lemon/list_graph.h - Part of LEMON, a generic C++ optimization library
    33 *
    44 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     
    1515 */
    1616
    17 #ifndef HUGO_LIST_GRAPH_H
    18 #define HUGO_LIST_GRAPH_H
     17#ifndef LEMON_LIST_GRAPH_H
     18#define LEMON_LIST_GRAPH_H
    1919
    2020///\ingroup graphs
     
    2525#include <climits>
    2626
    27 #include <hugo/invalid.h>
    28 
    29 #include <hugo/map_registry.h>
    30 #include <hugo/array_map.h>
    31 
    32 #include <hugo/sym_map.h>
    33 
    34 #include <hugo/map_defines.h>
    35 
    36 
    37 namespace hugo {
     27#include <lemon/invalid.h>
     28
     29#include <lemon/map_registry.h>
     30#include <lemon/array_map.h>
     31
     32#include <lemon/sym_map.h>
     33
     34#include <lemon/map_defines.h>
     35
     36
     37namespace lemon {
    3838
    3939/// \addtogroup graphs
     
    424424  ///of oppositely directed edges.
    425425  ///There is a new edge map type called
    426   ///\ref hugo::SymListGraph::SymEdgeMap "SymEdgeMap"
     426  ///\ref lemon::SymListGraph::SymEdgeMap "SymEdgeMap"
    427427  ///that complements this
    428428  ///feature by
    429429  ///storing shared values for the edge pairs. The usual
    430   ///\ref hugo::skeleton::StaticGraph::EdgeMap "EdgeMap"
     430  ///\ref lemon::skeleton::StaticGraph::EdgeMap "EdgeMap"
    431431  ///can be used
    432432  ///as well.
    433433  ///
    434434  ///The oppositely directed edge can also be obtained easily
    435   ///using \ref hugo::SymListGraph::opposite() "opposite()" member function.
     435  ///using \ref lemon::SymListGraph::opposite() "opposite()" member function.
    436436  ///
    437437  ///Here erase(Edge) deletes a pair of edges.
     
    11021102/// @} 
    11031103
    1104 } //namespace hugo
    1105 
    1106 #endif //HUGO_LIST_GRAPH_H
     1104} //namespace lemon
     1105
     1106#endif //LEMON_LIST_GRAPH_H
Note: See TracChangeset for help on using the changeset viewer.