Index: doc/graph_orientation.dox
===================================================================
--- doc/graph_orientation.dox (revision 1953)
+++ doc/graph_orientation.dox (revision 2158)
@@ -12,5 +12,5 @@
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).
@@ -114,5 +114,5 @@
\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
@@ -121,5 +121,6 @@
\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