1.1 --- a/lemon/concept/ugraph.h	Thu Mar 30 08:38:41 2006 +0000
     1.2 +++ b/lemon/concept/ugraph.h	Thu Mar 30 09:36:33 2006 +0000
     1.3 @@ -436,12 +436,13 @@
     1.4        /// edges of a node.
     1.5        ///
     1.6        /// This iterator goes trough the incident undirected edges
     1.7 -      /// of a certain node
     1.8 -      /// of a graph.
     1.9 +      /// of a certain node of a graph. You should assume that the 
    1.10 +      /// loop edges will be iterated twice.
    1.11 +      /// 
    1.12        /// Its usage is quite simple, for example you can compute the
    1.13 -      /// degree (i.e. count the number
    1.14 -      /// of incident edges of a node \c n
    1.15 -      /// in graph \c g of type \c Graph as follows.
    1.16 +      /// degree (i.e. count the number of incident edges of a node \c n
    1.17 +      /// in graph \c g of type \c Graph as follows. 
    1.18 +      ///
    1.19        ///\code
    1.20        /// int count=0;
    1.21        /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;