1.1 --- a/lemon/concepts/digraph.h	Fri Nov 13 17:30:26 2009 +0100
     1.2 +++ b/lemon/concepts/digraph.h	Fri Nov 13 18:10:06 2009 +0100
     1.3 @@ -107,7 +107,7 @@
     1.4        /// Iterator class for the nodes.
     1.5  
     1.6        /// This iterator goes through each node of the digraph.
     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 digraph \c g of type \c %Digraph like this:
    1.10        ///\code
    1.11        /// int count=0;
    1.12 @@ -196,7 +196,7 @@
    1.13  
    1.14        /// This iterator goes trough the \e outgoing arcs of a certain node
    1.15        /// of a digraph.
    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 outgoing arcs of a node \c n
    1.19        /// in a digraph \c g of type \c %Digraph as follows.
    1.20        ///\code
    1.21 @@ -241,7 +241,7 @@
    1.22  
    1.23        /// This iterator goes trough the \e incoming arcs of a certain node
    1.24        /// of a digraph.
    1.25 -      /// Its usage is quite simple, for example you can count the number
    1.26 +      /// Its usage is quite simple, for example, you can count the number
    1.27        /// of incoming arcs of a node \c n
    1.28        /// in a digraph \c g of type \c %Digraph as follows.
    1.29        ///\code
    1.30 @@ -285,7 +285,7 @@
    1.31        /// Iterator class for the arcs.
    1.32  
    1.33        /// This iterator goes through each arc of the digraph.
    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 digraph \c g of type \c %Digraph as follows:
    1.37        ///\code
    1.38        /// int count=0;