# HG changeset patch
# User deba
# Date 1143711393 0
# Node ID 11455e986b95d24cc234e2afd5828fd651596172
# Parent  332245399dc65dd4c46d4c5b37c578e93764e074
IncEdgeIt goes through on loop edges twice.

diff -r 332245399dc6 -r 11455e986b95 lemon/concept/ugraph.h
--- a/lemon/concept/ugraph.h	Thu Mar 30 08:38:41 2006 +0000
+++ b/lemon/concept/ugraph.h	Thu Mar 30 09:36:33 2006 +0000
@@ -436,12 +436,13 @@
       /// edges of a node.
       ///
       /// This iterator goes trough the incident undirected edges
-      /// of a certain node
-      /// of a graph.
+      /// of a certain node of a graph. You should assume that the 
+      /// loop edges will be iterated twice.
+      /// 
       /// Its usage is quite simple, for example you can compute the
-      /// degree (i.e. count the number
-      /// of incident edges of a node \c n
-      /// in graph \c g of type \c Graph as follows.
+      /// degree (i.e. count the number of incident edges of a node \c n
+      /// in graph \c g of type \c Graph as follows. 
+      ///
       ///\code
       /// int count=0;
       /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count;