diff -r f50c8c191cbd -r 59769591eb60 doc/graph-adaptors.dox
--- a/doc/graph-adaptors.dox	Mon May 15 09:46:33 2006 +0000
+++ b/doc/graph-adaptors.dox	Mon May 15 09:49:51 2006 +0000
@@ -36,8 +36,8 @@
    The code looks as follows 
    \code
    ListGraph g;
-   RevGraphAdaptor<ListGraph> rgw(g);
-   int result=algorithm(rgw);
+   RevGraphAdaptor<ListGraph> rga(g);
+   int result=algorithm(rga);
    \endcode
    After running the algorithm, the original graph \c g 
    is untouched. 
@@ -58,7 +58,7 @@
    capabilities of the original graph while in other cases this would be 
    meaningless. This means that the concepts that they are models of depend 
    on the graph adaptor, and the wrapped graph(s). 
-   If an edge of \c rgw is deleted, this is carried out by 
+   If an edge of \c rga is deleted, this is carried out by 
    deleting the corresponding edge of \c g, thus the adaptor modifies the 
    original graph. 
    But for a residual 
@@ -73,8 +73,8 @@
    then it have to be instantiated with <tt>Graph=const ListGraph</tt>.
    \code
    int algorithm1(const ListGraph& g) {
-   RevGraphAdaptor<const ListGraph> rgw(g);
-   return algorithm2(rgw);
+   RevGraphAdaptor<const ListGraph> rga(g);
+   return algorithm2(rga);
    }
    \endcode
 */