Changeset 2021:11455e986b95 in lemon0.x
 Timestamp:
 03/30/06 11:36:33 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2659
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/concept/ugraph.h
r1993 r2021 437 437 /// 438 438 /// This iterator goes trough the incident undirected edges 439 /// of a certain node 440 /// of a graph. 439 /// of a certain node of a graph. You should assume that the 440 /// loop edges will be iterated twice. 441 /// 441 442 /// Its usage is quite simple, for example you can compute the 442 /// degree (i.e. count the number 443 /// of incident edges of a node \c n444 /// in graph \c g of type \c Graph as follows.443 /// degree (i.e. count the number of incident edges of a node \c n 444 /// in graph \c g of type \c Graph as follows. 445 /// 445 446 ///\code 446 447 /// int count=0;
Note: See TracChangeset
for help on using the changeset viewer.