1.1 --- a/doc/graph_orientation.dox	Thu Jul 20 06:20:27 2006 +0000
     1.2 +++ b/doc/graph_orientation.dox	Thu Jul 20 14:12:01 2006 +0000
     1.3 @@ -11,7 +11,7 @@
     1.4  
     1.5  The input of the problem is a(n undirected) graph and an integer value
     1.6  <i>f(n)</i> assigned to each node \e n. The task is to find an orientation
     1.7 -of the edges for which the number of edge arriving to each node \e n is at
     1.8 +of the edges for which the number of edge arriving at each node \e n is at
     1.9  least least <i>f(n)</i>.
    1.10  
    1.11  In fact, the algorithm reads a directed graph and computes a set of edges to
    1.12 @@ -113,14 +113,15 @@
    1.13  The variable \c nodeNum will refer to the number of nodes.
    1.14  \skipline nodeNum
    1.15  
    1.16 -Here comes the algorithms itself. 
    1.17 +Here comes the algorithm itself. 
    1.18  In each iteration we choose an active node (\c act will do it for us).
    1.19  If there is
    1.20  no such a node, then the orientation is feasible so we are done.
    1.21  \skip act
    1.22  \until while
    1.23  
    1.24 -Then we check if there exists an edge leaving this node that steps down exactly
    1.25 +Then we check if there exists an edge leaving this node and
    1.26 +stepping down exactly
    1.27  one level.
    1.28  \skip OutEdge
    1.29  \until while