# HG changeset patch
# User alpar
# Date 1153404721 0
# Node ID 0b620ff10e7c1e7ce8458c326e9f6aef16c9692d
# Parent  f9171bfc7ebb23e2c42b67aead7a4731b5deaa26
Minor doc improvement

diff -r f9171bfc7ebb -r 0b620ff10e7c demo/graph_orientation.cc
--- a/demo/graph_orientation.cc	Thu Jul 20 06:20:27 2006 +0000
+++ b/demo/graph_orientation.cc	Thu Jul 20 14:12:01 2006 +0000
@@ -74,7 +74,7 @@
   IterableBoolMap<ListGraph, Node> active(g,false);
   for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0);
   
-  ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is be 
+  ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is to be 
                                          //                  reversed
 
   int nodeNum=countNodes(g);
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
 <i>f(n)</i> 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 <i>f(n)</i>.
 
 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