Changeset 833:e20173729589 in lemon for lemon/concepts/graph.h
- Timestamp:
- 11/13/09 18:10:06 (15 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/graph.h
r781 r833 141 141 142 142 /// This iterator goes through each node of the graph. 143 /// Its usage is quite simple, for example you can count the number143 /// Its usage is quite simple, for example, you can count the number 144 144 /// of nodes in a graph \c g of type \c %Graph like this: 145 145 ///\code … … 229 229 230 230 /// This iterator goes through each edge of the graph. 231 /// Its usage is quite simple, for example you can count the number231 /// Its usage is quite simple, for example, you can count the number 232 232 /// of edges in a graph \c g of type \c %Graph as follows: 233 233 ///\code … … 273 273 /// This iterator goes trough the incident undirected edges 274 274 /// of a certain node of a graph. 275 /// Its usage is quite simple, for example you can compute the275 /// Its usage is quite simple, for example, you can compute the 276 276 /// degree (i.e. the number of incident edges) of a node \c n 277 277 /// in a graph \c g of type \c %Graph as follows. … … 370 370 371 371 /// This iterator goes through each directed arc of the graph. 372 /// Its usage is quite simple, for example you can count the number372 /// Its usage is quite simple, for example, you can count the number 373 373 /// of arcs in a graph \c g of type \c %Graph as follows: 374 374 ///\code … … 414 414 /// This iterator goes trough the \e outgoing directed arcs of a 415 415 /// certain node of a graph. 416 /// Its usage is quite simple, for example you can count the number416 /// Its usage is quite simple, for example, you can count the number 417 417 /// of outgoing arcs of a node \c n 418 418 /// in a graph \c g of type \c %Graph as follows. … … 462 462 /// This iterator goes trough the \e incoming directed arcs of a 463 463 /// certain node of a graph. 464 /// Its usage is quite simple, for example you can count the number464 /// Its usage is quite simple, for example, you can count the number 465 465 /// of incoming arcs of a node \c n 466 466 /// in a graph \c g of type \c %Graph as follows. … … 588 588 /// Returns the first node of the given edge. 589 589 /// 590 /// Edges don't have source and target nodes, however methods590 /// Edges don't have source and target nodes, however, methods 591 591 /// u() and v() are used to query the two end-nodes of an edge. 592 592 /// The orientation of an edge that arises this way is called … … 601 601 /// Returns the second node of the given edge. 602 602 /// 603 /// Edges don't have source and target nodes, however methods603 /// Edges don't have source and target nodes, however, methods 604 604 /// u() and v() are used to query the two end-nodes of an edge. 605 605 /// The orientation of an edge that arises this way is called
Note: See TracChangeset
for help on using the changeset viewer.