[Lemon-commits] [lemon_svn] alpar: r1100 - in hugo/trunk/src: hugo/skeletons work/klao

[Lemon SVN]

Author: alpar
Date: Mon Sep  6 10:55:06 2004
New Revision: 1100

Modified:
   hugo/trunk/src/hugo/skeletons/path.h
   hugo/trunk/src/work/klao/path.h

Log:
Minor changes in doc.

Modified: hugo/trunk/src/hugo/skeletons/path.h
==============================================================================
--- hugo/trunk/src/hugo/skeletons/path.h	(original)
+++ hugo/trunk/src/hugo/skeletons/path.h	Mon Sep  6 10:55:06 2004
@@ -1,19 +1,5 @@
 // -*- c++ -*- //
 
-/**
- at defgroup paths Path Structures
- at ingroup datas
-\brief Path structures implemented in Hugo.
-
-Hugolib provides flexible data structures
-to work with paths.
-
-All of them have the same interface, especially they can be built or extended
-using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
-algorithm to store its result in any kind of path structure.
-
-*/
-
 ///\ingroup paths
 ///\file
 ///\brief Classes for representing paths in graphs.
@@ -21,13 +7,7 @@
 #ifndef HUGO_PATH_H
 #define HUGO_PATH_H
 
-#include <deque>
-#include <vector>
-#include <algorithm>
-
 #include <hugo/invalid.h>
-#include <hugo/error.h>
-#include <debug.h>
 
 namespace hugo {
   namespace skeleton {
@@ -35,9 +15,9 @@
     /// @{
     
     
-    //! \brief A structure for representing directed path in a graph.
+    //! \brief A skeletom structure for representing directed paths in a graph.
     //!
-    //! A structure for representing directed path in a graph.
+    //! A skeleton structure for representing directed paths in a graph.
     //! \param GR The graph type in which the path is.
     //! 
     //! In a sense, the path can be treated as a graph, for is has \c NodeIt

Modified: hugo/trunk/src/work/klao/path.h
==============================================================================
--- hugo/trunk/src/work/klao/path.h	(original)
+++ hugo/trunk/src/work/klao/path.h	Mon Sep  6 10:55:06 2004
@@ -12,6 +12,8 @@
 using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
 algorithm to store its result in any kind of path structure.
 
+\sa hugo::skeleton::Path
+
 */
 
 ///\ingroup paths
@@ -35,7 +37,7 @@
   /// @{
 
 
-  //! \brief A structure for representing directed path in a graph.
+  //! \brief A structure for representing directed paths in a graph.
   //!
   //! A structure for representing directed path in a graph.
   //! \param Graph The graph type in which the path is.