1.1 --- a/src/hugo/skeletons/path.h	Mon Sep 06 08:22:48 2004 +0000
     1.2 +++ b/src/hugo/skeletons/path.h	Mon Sep 06 08:55:06 2004 +0000
     1.3 @@ -1,19 +1,5 @@
     1.4  // -*- c++ -*- //
     1.5  
     1.6 -/**
     1.7 -@defgroup paths Path Structures
     1.8 -@ingroup datas
     1.9 -\brief Path structures implemented in Hugo.
    1.10 -
    1.11 -Hugolib provides flexible data structures
    1.12 -to work with paths.
    1.13 -
    1.14 -All of them have the same interface, especially they can be built or extended
    1.15 -using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
    1.16 -algorithm to store its result in any kind of path structure.
    1.17 -
    1.18 -*/
    1.19 -
    1.20  ///\ingroup paths
    1.21  ///\file
    1.22  ///\brief Classes for representing paths in graphs.
    1.23 @@ -21,13 +7,7 @@
    1.24  #ifndef HUGO_PATH_H
    1.25  #define HUGO_PATH_H
    1.26  
    1.27 -#include <deque>
    1.28 -#include <vector>
    1.29 -#include <algorithm>
    1.30 -
    1.31  #include <hugo/invalid.h>
    1.32 -#include <hugo/error.h>
    1.33 -#include <debug.h>
    1.34  
    1.35  namespace hugo {
    1.36    namespace skeleton {
    1.37 @@ -35,9 +15,9 @@
    1.38      /// @{
    1.39      
    1.40      
    1.41 -    //! \brief A structure for representing directed path in a graph.
    1.42 +    //! \brief A skeletom structure for representing directed paths in a graph.
    1.43      //!
    1.44 -    //! A structure for representing directed path in a graph.
    1.45 +    //! A skeleton structure for representing directed paths in a graph.
    1.46      //! \param GR The graph type in which the path is.
    1.47      //! 
    1.48      //! In a sense, the path can be treated as a graph, for is has \c NodeIt

     2.1 --- a/src/work/klao/path.h	Mon Sep 06 08:22:48 2004 +0000
     2.2 +++ b/src/work/klao/path.h	Mon Sep 06 08:55:06 2004 +0000
     2.3 @@ -12,6 +12,8 @@
     2.4  using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
     2.5  algorithm to store its result in any kind of path structure.
     2.6  
     2.7 +\sa hugo::skeleton::Path
     2.8 +
     2.9  */
    2.10  
    2.11  ///\ingroup paths
    2.12 @@ -35,7 +37,7 @@
    2.13    /// @{
    2.14  
    2.15  
    2.16 -  //! \brief A structure for representing directed path in a graph.
    2.17 +  //! \brief A structure for representing directed paths in a graph.
    2.18    //!
    2.19    //! A structure for representing directed path in a graph.
    2.20    //! \param Graph The graph type in which the path is.