# Changeset 833:e20173729589 in lemon for lemon/concepts/graph.h

Ignore:
Timestamp:
11/13/09 18:10:06 (11 years ago)
Branch:
default
Phase:
public
Message:

Small doc fixes in several files (#331)

File:
1 edited

Unmodified
Removed
• ## lemon/concepts/graph.h

 r781 /// This iterator goes through each node of the graph. /// Its usage is quite simple, for example you can count the number /// Its usage is quite simple, for example, you can count the number /// of nodes in a graph \c g of type \c %Graph like this: ///\code /// This iterator goes through each edge of the graph. /// Its usage is quite simple, for example you can count the number /// Its usage is quite simple, for example, you can count the number /// of edges in a graph \c g of type \c %Graph as follows: ///\code /// This iterator goes trough the incident undirected edges /// of a certain node of a graph. /// Its usage is quite simple, for example you can compute the /// Its usage is quite simple, for example, you can compute the /// degree (i.e. the number of incident edges) of a node \c n /// in a graph \c g of type \c %Graph as follows. /// This iterator goes through each directed arc of the graph. /// Its usage is quite simple, for example you can count the number /// Its usage is quite simple, for example, you can count the number /// of arcs in a graph \c g of type \c %Graph as follows: ///\code /// This iterator goes trough the \e outgoing directed arcs of a /// certain node of a graph. /// Its usage is quite simple, for example you can count the number /// Its usage is quite simple, for example, you can count the number /// of outgoing arcs of a node \c n /// in a graph \c g of type \c %Graph as follows. /// This iterator goes trough the \e incoming directed arcs of a /// certain node of a graph. /// Its usage is quite simple, for example you can count the number /// Its usage is quite simple, for example, you can count the number /// of incoming arcs of a node \c n /// in a graph \c g of type \c %Graph as follows. /// Returns the first node of the given edge. /// /// Edges don't have source and target nodes, however methods /// Edges don't have source and target nodes, however, methods /// u() and v() are used to query the two end-nodes of an edge. /// The orientation of an edge that arises this way is called /// Returns the second node of the given edge. /// /// Edges don't have source and target nodes, however methods /// Edges don't have source and target nodes, however, methods /// u() and v() are used to query the two end-nodes of an edge. /// The orientation of an edge that arises this way is called
Note: See TracChangeset for help on using the changeset viewer.