diff -r f9171bfc7ebb -r 0b620ff10e7c doc/graph_orientation.dox
--- a/doc/graph_orientation.dox Thu Jul 20 06:20:27 2006 +0000
+++ b/doc/graph_orientation.dox Thu Jul 20 14:12:01 2006 +0000
@@ -11,7 +11,7 @@
The input of the problem is a(n undirected) graph and an integer value
f(n) assigned to each node \e n. The task is to find an orientation
-of the edges for which the number of edge arriving to each node \e n is at
+of the edges for which the number of edge arriving at each node \e n is at
least least f(n).
In fact, the algorithm reads a directed graph and computes a set of edges to
@@ -113,14 +113,15 @@
The variable \c nodeNum will refer to the number of nodes.
\skipline nodeNum
-Here comes the algorithms itself.
+Here comes the algorithm itself.
In each iteration we choose an active node (\c act will do it for us).
If there is
no such a node, then the orientation is feasible so we are done.
\skip act
\until while
-Then we check if there exists an edge leaving this node that steps down exactly
+Then we check if there exists an edge leaving this node and
+stepping down exactly
one level.
\skip OutEdge
\until while