1.1 --- a/lemon/concepts/graph.h	Fri Nov 13 17:30:26 2009 +0100
     1.2 +++ b/lemon/concepts/graph.h	Fri Nov 13 18:10:06 2009 +0100
     1.3 @@ -140,7 +140,7 @@
     1.4        /// Iterator class for the nodes.
     1.5  
     1.6        /// This iterator goes through each node of the graph.
     1.7 -      /// Its usage is quite simple, for example you can count the number
     1.8 +      /// Its usage is quite simple, for example, you can count the number
     1.9        /// of nodes in a graph \c g of type \c %Graph like this:
    1.10        ///\code
    1.11        /// int count=0;
    1.12 @@ -228,7 +228,7 @@
    1.13        /// Iterator class for the edges.
    1.14  
    1.15        /// This iterator goes through each edge of the graph.
    1.16 -      /// Its usage is quite simple, for example you can count the number
    1.17 +      /// Its usage is quite simple, for example, you can count the number
    1.18        /// of edges in a graph \c g of type \c %Graph as follows:
    1.19        ///\code
    1.20        /// int count=0;
    1.21 @@ -272,7 +272,7 @@
    1.22  
    1.23        /// This iterator goes trough the incident undirected edges
    1.24        /// of a certain node of a graph.
    1.25 -      /// Its usage is quite simple, for example you can compute the
    1.26 +      /// Its usage is quite simple, for example, you can compute the
    1.27        /// degree (i.e. the number of incident edges) of a node \c n
    1.28        /// in a graph \c g of type \c %Graph as follows.
    1.29        ///
    1.30 @@ -369,7 +369,7 @@
    1.31        /// Iterator class for the arcs.
    1.32  
    1.33        /// This iterator goes through each directed arc of the graph.
    1.34 -      /// Its usage is quite simple, for example you can count the number
    1.35 +      /// Its usage is quite simple, for example, you can count the number
    1.36        /// of arcs in a graph \c g of type \c %Graph as follows:
    1.37        ///\code
    1.38        /// int count=0;
    1.39 @@ -413,7 +413,7 @@
    1.40  
    1.41        /// This iterator goes trough the \e outgoing directed arcs of a
    1.42        /// certain node of a graph.
    1.43 -      /// Its usage is quite simple, for example you can count the number
    1.44 +      /// Its usage is quite simple, for example, you can count the number
    1.45        /// of outgoing arcs of a node \c n
    1.46        /// in a graph \c g of type \c %Graph as follows.
    1.47        ///\code
    1.48 @@ -461,7 +461,7 @@
    1.49  
    1.50        /// This iterator goes trough the \e incoming directed arcs of a
    1.51        /// certain node of a graph.
    1.52 -      /// Its usage is quite simple, for example you can count the number
    1.53 +      /// Its usage is quite simple, for example, you can count the number
    1.54        /// of incoming arcs of a node \c n
    1.55        /// in a graph \c g of type \c %Graph as follows.
    1.56        ///\code
    1.57 @@ -587,7 +587,7 @@
    1.58        ///
    1.59        /// Returns the first node of the given edge.
    1.60        ///
    1.61 -      /// Edges don't have source and target nodes, however methods
    1.62 +      /// Edges don't have source and target nodes, however, methods
    1.63        /// u() and v() are used to query the two end-nodes of an edge.
    1.64        /// The orientation of an edge that arises this way is called
    1.65        /// the inherent direction, it is used to define the default
    1.66 @@ -600,7 +600,7 @@
    1.67        ///
    1.68        /// Returns the second node of the given edge.
    1.69        ///
    1.70 -      /// Edges don't have source and target nodes, however methods
    1.71 +      /// Edges don't have source and target nodes, however, methods
    1.72        /// u() and v() are used to query the two end-nodes of an edge.
    1.73        /// The orientation of an edge that arises this way is called
    1.74        /// the inherent direction, it is used to define the default