equal
deleted
inserted
replaced
15 */ |
15 */ |
16 |
16 |
17 ///\ingroup concept |
17 ///\ingroup concept |
18 ///\file |
18 ///\file |
19 ///\brief Classes for representing paths in graphs. |
19 ///\brief Classes for representing paths in graphs. |
|
20 /// |
|
21 ///\todo Iterators have obsolete style |
20 |
22 |
21 #ifndef LEMON_CONCEPT_PATH_H |
23 #ifndef LEMON_CONCEPT_PATH_H |
22 #define LEMON_CONCEPT_PATH_H |
24 #define LEMON_CONCEPT_PATH_H |
23 |
25 |
24 #include <lemon/invalid.h> |
26 #include <lemon/invalid.h> |
96 /* Iterator classes */ |
98 /* Iterator classes */ |
97 |
99 |
98 /** |
100 /** |
99 * \brief Iterator class to iterate on the edges of the paths |
101 * \brief Iterator class to iterate on the edges of the paths |
100 * |
102 * |
101 * \ingroup concept |
|
102 * This class is used to iterate on the edges of the paths |
103 * This class is used to iterate on the edges of the paths |
103 * |
104 * |
104 * Of course it converts to Graph::Edge |
105 * Of course it converts to Graph::Edge |
105 * |
106 * |
106 */ |
107 */ |
129 }; |
130 }; |
130 |
131 |
131 /** |
132 /** |
132 * \brief Iterator class to iterate on the nodes of the paths |
133 * \brief Iterator class to iterate on the nodes of the paths |
133 * |
134 * |
134 * \ingroup concept |
|
135 * This class is used to iterate on the nodes of the paths |
135 * This class is used to iterate on the nodes of the paths |
136 * |
136 * |
137 * Of course it converts to Graph::Node. |
137 * Of course it converts to Graph::Node. |
138 * |
138 * |
139 */ |
139 */ |
164 friend class Builder; |
164 friend class Builder; |
165 |
165 |
166 /** |
166 /** |
167 * \brief Class to build paths |
167 * \brief Class to build paths |
168 * |
168 * |
169 * \ingroup concept |
|
170 * This class is used to fill a path with edges. |
169 * This class is used to fill a path with edges. |
171 * |
170 * |
172 * You can push new edges to the front and to the back of the path in |
171 * You can push new edges to the front and to the back of the path in |
173 * arbitrary order then you should commit these changes to the graph. |
172 * arbitrary order then you should commit these changes to the graph. |
174 * |
173 * |