src/work/peter/path/path.h
changeset 958 75f749682240
parent 815 468c9ec86928
child 959 c80ef5912903
equal deleted inserted replaced
0:992e8c93f9be 1:552c0c979dfd
     1 // -*- c++ -*- //
     1 // -*- c++ -*- //
     2 
     2 
     3 /**
     3 /**
     4 @defgroup paths Path Structures
     4 @defgroup paths Path Structures
     5 @ingroup datas
     5 @ingroup datas
     6 \brief Path structures implemented in Hugo.
     6 \brief Path structures implemented in LEMON.
     7 
     7 
     8 Hugolib provides flexible data structures
     8 LEMON provides flexible data structures
     9 to work with paths.
     9 to work with paths.
    10 
    10 
    11 All of them have the same interface, especially they can be built or extended
    11 All of them have the same interface, especially they can be built or extended
    12 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
    12 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
    13 algorithm to store its result in any kind of path structure.
    13 algorithm to store its result in any kind of path structure.
    14 
    14 
    15 \sa hugo::skeleton::Path
    15 \sa lemon::skeleton::Path
    16 
    16 
    17 */
    17 */
    18 
    18 
    19 ///\ingroup paths
    19 ///\ingroup paths
    20 ///\file
    20 ///\file
    21 ///\brief Classes for representing paths in graphs.
    21 ///\brief Classes for representing paths in graphs.
    22 
    22 
    23 #ifndef HUGO_PATH_H
    23 #ifndef LEMON_PATH_H
    24 #define HUGO_PATH_H
    24 #define LEMON_PATH_H
    25 
    25 
    26 #include <deque>
    26 #include <deque>
    27 #include <vector>
    27 #include <vector>
    28 #include <algorithm>
    28 #include <algorithm>
    29 
    29 
    30 #include <hugo/invalid.h>
    30 #include <lemon/invalid.h>
    31 #include <hugo/error.h>
    31 #include <lemon/error.h>
    32 #include <debug.h>
    32 #include <debug.h>
    33 
    33 
    34 namespace hugo {
    34 namespace lemon {
    35 
    35 
    36   /// \addtogroup paths
    36   /// \addtogroup paths
    37   /// @{
    37   /// @{
    38 
    38 
    39 
    39 
  1167     _last = P.graphNode(b);
  1167     _last = P.graphNode(b);
  1168   }
  1168   }
  1169 
  1169 
  1170   ///@}
  1170   ///@}
  1171 
  1171 
  1172 } // namespace hugo
  1172 } // namespace lemon
  1173 
  1173 
  1174 #endif // HUGO_PATH_H
  1174 #endif // LEMON_PATH_H