src/lemon/path.h
changeset 950 d74557d1f100
parent 906 17f31d280385
child 959 c80ef5912903
equal deleted inserted replaced
7:0953082011e4 0:d7af68ffe73e
     1 /* -*- C++ -*-
     1 /* -*- C++ -*-
     2  * src/hugo/path.h - Part of HUGOlib, a generic C++ optimization library
     2  * src/lemon/path.h - Part of LEMON, a generic C++ optimization library
     3  *
     3  *
     4  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     4  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5  * (Egervary Combinatorial Optimization Research Group, EGRES).
     5  * (Egervary Combinatorial Optimization Research Group, EGRES).
     6  *
     6  *
     7  * Permission to use, modify and distribute this software is granted
     7  * Permission to use, modify and distribute this software is granted
    15  */
    15  */
    16 
    16 
    17 /**
    17 /**
    18 @defgroup paths Path Structures
    18 @defgroup paths Path Structures
    19 @ingroup datas
    19 @ingroup datas
    20 \brief Path structures implemented in Hugo.
    20 \brief Path structures implemented in LEMON.
    21 
    21 
    22 Hugolib provides flexible data structures
    22 LEMON provides flexible data structures
    23 to work with paths.
    23 to work with paths.
    24 
    24 
    25 All of them have the same interface, especially they can be built or extended
    25 All of them have the same interface, especially they can be built or extended
    26 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
    26 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
    27 algorithm to store its result in any kind of path structure.
    27 algorithm to store its result in any kind of path structure.
    28 
    28 
    29 \sa hugo::skeleton::Path
    29 \sa lemon::skeleton::Path
    30 
    30 
    31 */
    31 */
    32 
    32 
    33 ///\ingroup paths
    33 ///\ingroup paths
    34 ///\file
    34 ///\file
    35 ///\brief Classes for representing paths in graphs.
    35 ///\brief Classes for representing paths in graphs.
    36 
    36 
    37 #ifndef HUGO_PATH_H
    37 #ifndef LEMON_PATH_H
    38 #define HUGO_PATH_H
    38 #define LEMON_PATH_H
    39 
    39 
    40 #include <deque>
    40 #include <deque>
    41 #include <vector>
    41 #include <vector>
    42 #include <algorithm>
    42 #include <algorithm>
    43 
    43 
    44 #include <hugo/invalid.h>
    44 #include <lemon/invalid.h>
    45 
    45 
    46 namespace hugo {
    46 namespace lemon {
    47 
    47 
    48   /// \addtogroup paths
    48   /// \addtogroup paths
    49   /// @{
    49   /// @{
    50 
    50 
    51 
    51 
   702   };
   702   };
   703 
   703 
   704 
   704 
   705   ///@}
   705   ///@}
   706 
   706 
   707 } // namespace hugo
   707 } // namespace lemon
   708 
   708 
   709 #endif // HUGO_PATH_H
   709 #endif // LEMON_PATH_H