1.1 --- a/demo/graph_orientation.cc	Thu Jul 20 06:20:27 2006 +0000
     1.2 +++ b/demo/graph_orientation.cc	Thu Jul 20 14:12:01 2006 +0000
     1.3 @@ -74,7 +74,7 @@
     1.4    IterableBoolMap<ListGraph, Node> active(g,false);
     1.5    for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0);
     1.6    
     1.7 -  ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is be 
     1.8 +  ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is to be 
     1.9                                           //                  reversed
    1.10  
    1.11    int nodeNum=countNodes(g);