1.1 --- a/doc/graph-adaptors.dox	Mon May 15 09:46:33 2006 +0000
     1.2 +++ b/doc/graph-adaptors.dox	Mon May 15 09:49:51 2006 +0000
     1.3 @@ -36,8 +36,8 @@
     1.4     The code looks as follows 
     1.5     \code
     1.6     ListGraph g;
     1.7 -   RevGraphAdaptor<ListGraph> rgw(g);
     1.8 -   int result=algorithm(rgw);
     1.9 +   RevGraphAdaptor<ListGraph> rga(g);
    1.10 +   int result=algorithm(rga);
    1.11     \endcode
    1.12     After running the algorithm, the original graph \c g 
    1.13     is untouched. 
    1.14 @@ -58,7 +58,7 @@
    1.15     capabilities of the original graph while in other cases this would be 
    1.16     meaningless. This means that the concepts that they are models of depend 
    1.17     on the graph adaptor, and the wrapped graph(s). 
    1.18 -   If an edge of \c rgw is deleted, this is carried out by 
    1.19 +   If an edge of \c rga is deleted, this is carried out by 
    1.20     deleting the corresponding edge of \c g, thus the adaptor modifies the 
    1.21     original graph. 
    1.22     But for a residual 
    1.23 @@ -73,8 +73,8 @@
    1.24     then it have to be instantiated with <tt>Graph=const ListGraph</tt>.
    1.25     \code
    1.26     int algorithm1(const ListGraph& g) {
    1.27 -   RevGraphAdaptor<const ListGraph> rgw(g);
    1.28 -   return algorithm2(rgw);
    1.29 +   RevGraphAdaptor<const ListGraph> rga(g);
    1.30 +   return algorithm2(rga);
    1.31     }
    1.32     \endcode
    1.33  */