1.1 --- a/src/lemon/path.h Tue Feb 15 15:00:31 2005 +0000
1.2 +++ b/src/lemon/path.h Wed Feb 16 16:17:30 2005 +0000
1.3 @@ -33,6 +33,8 @@
1.4 ///\ingroup paths
1.5 ///\file
1.6 ///\brief Classes for representing paths in graphs.
1.7 +///
1.8 +///\todo Iterators have obsolete style
1.9
1.10 #ifndef LEMON_PATH_H
1.11 #define LEMON_PATH_H
1.12 @@ -157,7 +159,6 @@
1.13 /**
1.14 * \brief Iterator class to iterate on the edges of the paths
1.15 *
1.16 - * \ingroup paths
1.17 * This class is used to iterate on the edges of the paths
1.18 *
1.19 * Of course it converts to Graph::Edge
1.20 @@ -204,7 +205,6 @@
1.21 /**
1.22 * \brief Iterator class to iterate on the nodes of the paths
1.23 *
1.24 - * \ingroup paths
1.25 * This class is used to iterate on the nodes of the paths
1.26 *
1.27 * Of course it converts to Graph::Node
1.28 @@ -255,7 +255,6 @@
1.29 /**
1.30 * \brief Class to build paths
1.31 *
1.32 - * \ingroup paths
1.33 * This class is used to fill a path with edges.
1.34 *
1.35 * You can push new edges to the front and to the back of the path in
1.36 @@ -494,7 +493,6 @@
1.37 /**
1.38 * \brief Iterator class to iterate on the edges of the paths
1.39 *
1.40 - * \ingroup paths
1.41 * This class is used to iterate on the edges of the paths
1.42 *
1.43 * Of course it converts to Graph::Edge
1.44 @@ -542,7 +540,6 @@
1.45 /**
1.46 * \brief Iterator class to iterate on the nodes of the paths
1.47 *
1.48 - * \ingroup paths
1.49 * This class is used to iterate on the nodes of the paths
1.50 *
1.51 * Of course it converts to Graph::Node
1.52 @@ -595,7 +592,6 @@
1.53 /**
1.54 * \brief Class to build paths
1.55 *
1.56 - * \ingroup paths
1.57 * This class is used to fill a path with edges.
1.58 *
1.59 * You can push new edges to the front and to the back of the path in