# Changeset 2021:11455e986b95 in lemon-0.x

Ignore:
Timestamp:
03/30/06 11:36:33 (14 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2659
Message:

IncEdgeIt? goes through on loop edges twice.

File:
1 edited

Unmodified
Removed
• ## lemon/concept/ugraph.h

 r1993 /// /// 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;
Note: See TracChangeset for help on using the changeset viewer.