1.1 --- a/doc/graph_orientation.dox	Thu Jun 07 20:07:29 2007 +0000
     1.2 +++ b/doc/graph_orientation.dox	Tue Jun 12 14:34:28 2007 +0000
     1.3 @@ -134,7 +134,7 @@
     1.4  \skip active
     1.5  \until def
     1.6  
     1.7 -We also store in a bool map indicating which edges are reverted.
     1.8 +We also store a bool map indicating which edges are reverted.
     1.9  Actually this map called \c rev is only
    1.10  used to draw these edges with different color in the output picture. The
    1.11  algorithm updates this map, but will not use it otherwise.
    1.12 @@ -167,7 +167,7 @@
    1.13  \skipline if
    1.14  \skip if
    1.15  \until }
    1.16 -Otherwise (i.e. if there is no edge stepping down one level). We lift up the
    1.17 +Otherwise (i.e. if there is no edge stepping down one level) we lift up the
    1.18  current active node \c act. If it reaches level \c nodeNum, then there
    1.19  exists no appropriate orientation so we stop.
    1.20  \skipline else