equal
deleted
inserted
replaced
434 |
434 |
435 /// \brief This iterator goes trough the incident undirected |
435 /// \brief This iterator goes trough the incident undirected |
436 /// edges of a node. |
436 /// edges of a node. |
437 /// |
437 /// |
438 /// This iterator goes trough the incident undirected edges |
438 /// This iterator goes trough the incident undirected edges |
439 /// of a certain node |
439 /// of a certain node of a graph. You should assume that the |
440 /// of a graph. |
440 /// loop edges will be iterated twice. |
|
441 /// |
441 /// Its usage is quite simple, for example you can compute the |
442 /// Its usage is quite simple, for example you can compute the |
442 /// degree (i.e. count the number |
443 /// degree (i.e. count the number of incident edges of a node \c n |
443 /// of incident edges of a node \c n |
444 /// in graph \c g of type \c Graph as follows. |
444 /// in graph \c g of type \c Graph as follows. |
445 /// |
445 ///\code |
446 ///\code |
446 /// int count=0; |
447 /// int count=0; |
447 /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
448 /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count; |
448 ///\endcode |
449 ///\endcode |
449 class IncEdgeIt : public UEdge { |
450 class IncEdgeIt : public UEdge { |