Changeset 2084:59769591eb60 in lemon-0.x for doc/graph-adaptors.dox

Timestamp:

05/15/06 11:49:51 (15 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2749

Message:

Documentation improvements

Rearrangements:

IO modules
Algorithms

New documentation:

SwapBpUGraphAdaptor

Demos:

strongly_connected_orientation.cc

Benchmarks:

swap_bipartite_bench.cc

File:

• doc/graph-adaptors.dox (modified) (3 diffs)

doc/graph-adaptors.dox

@@ -37 +37 @@
    \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 
@@ -59 +59 @@
    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. 
@@ -74 +74 @@
    \code
    int algorithm1(const ListGraph& g) {
-   RevGraphAdaptor<const ListGraph> rgw(g);
-   return algorithm2(rgw);
+   RevGraphAdaptor<const ListGraph> rga(g);
+   return algorithm2(rga);
    }
    \endcode