Index: lemon/concept/ugraph.h
===================================================================
--- lemon/concept/ugraph.h (revision 1993)
+++ lemon/concept/ugraph.h (revision 2021)
@@ -437,10 +437,11 @@
///
/// 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;