equal
deleted
inserted
replaced
190 /// This iterator goes through each node. |
190 /// This iterator goes through each node. |
191 |
191 |
192 /// This iterator goes through each node. |
192 /// This iterator goes through each node. |
193 /// Its usage is quite simple, for example you can count the number |
193 /// Its usage is quite simple, for example you can count the number |
194 /// of nodes in graph \c g of type \c Graph like this: |
194 /// of nodes in graph \c g of type \c Graph like this: |
195 /// \code |
195 ///\code |
196 /// int count=0; |
196 /// int count=0; |
197 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count; |
197 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count; |
198 /// \endcode |
198 ///\endcode |
199 class NodeIt : public Node { |
199 class NodeIt : public Node { |
200 public: |
200 public: |
201 /// Default constructor |
201 /// Default constructor |
202 |
202 |
203 /// @warning The default constructor sets the iterator |
203 /// @warning The default constructor sets the iterator |
283 /// This iterator goes trough the \e outgoing edges of a certain node |
283 /// This iterator goes trough the \e outgoing edges of a certain node |
284 /// of a graph. |
284 /// of a graph. |
285 /// Its usage is quite simple, for example you can count the number |
285 /// Its usage is quite simple, for example you can count the number |
286 /// of outgoing edges of a node \c n |
286 /// of outgoing edges of a node \c n |
287 /// in graph \c g of type \c Graph as follows. |
287 /// in graph \c g of type \c Graph as follows. |
288 /// \code |
288 ///\code |
289 /// int count=0; |
289 /// int count=0; |
290 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
290 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
291 /// \endcode |
291 ///\endcode |
292 |
292 |
293 class OutEdgeIt : public Edge { |
293 class OutEdgeIt : public Edge { |
294 public: |
294 public: |
295 /// Default constructor |
295 /// Default constructor |
296 |
296 |
330 /// This iterator goes trough the \e incoming edges of a certain node |
330 /// This iterator goes trough the \e incoming edges of a certain node |
331 /// of a graph. |
331 /// of a graph. |
332 /// Its usage is quite simple, for example you can count the number |
332 /// Its usage is quite simple, for example you can count the number |
333 /// of outgoing edges of a node \c n |
333 /// of outgoing edges of a node \c n |
334 /// in graph \c g of type \c Graph as follows. |
334 /// in graph \c g of type \c Graph as follows. |
335 /// \code |
335 ///\code |
336 /// int count=0; |
336 /// int count=0; |
337 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
337 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
338 /// \endcode |
338 ///\endcode |
339 |
339 |
340 class InEdgeIt : public Edge { |
340 class InEdgeIt : public Edge { |
341 public: |
341 public: |
342 /// Default constructor |
342 /// Default constructor |
343 |
343 |
374 /// This iterator goes through each edge. |
374 /// This iterator goes through each edge. |
375 |
375 |
376 /// This iterator goes through each edge of a graph. |
376 /// This iterator goes through each edge of a graph. |
377 /// Its usage is quite simple, for example you can count the number |
377 /// Its usage is quite simple, for example you can count the number |
378 /// of edges in a graph \c g of type \c Graph as follows: |
378 /// of edges in a graph \c g of type \c Graph as follows: |
379 /// \code |
379 ///\code |
380 /// int count=0; |
380 /// int count=0; |
381 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count; |
381 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count; |
382 /// \endcode |
382 ///\endcode |
383 class EdgeIt : public Edge { |
383 class EdgeIt : public Edge { |
384 public: |
384 public: |
385 /// Default constructor |
385 /// Default constructor |
386 |
386 |
387 /// @warning The default constructor sets the iterator |
387 /// @warning The default constructor sets the iterator |