COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
05/15/06 11:49:51 (14 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:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graph-adaptors.dox

    r1949 r2084  
    3737   \code
    3838   ListGraph g;
    39    RevGraphAdaptor<ListGraph> rgw(g);
    40    int result=algorithm(rgw);
     39   RevGraphAdaptor<ListGraph> rga(g);
     40   int result=algorithm(rga);
    4141   \endcode
    4242   After running the algorithm, the original graph \c g
     
    5959   meaningless. This means that the concepts that they are models of depend
    6060   on the graph adaptor, and the wrapped graph(s).
    61    If an edge of \c rgw is deleted, this is carried out by
     61   If an edge of \c rga is deleted, this is carried out by
    6262   deleting the corresponding edge of \c g, thus the adaptor modifies the
    6363   original graph.
     
    7474   \code
    7575   int algorithm1(const ListGraph& g) {
    76    RevGraphAdaptor<const ListGraph> rgw(g);
    77    return algorithm2(rgw);
     76   RevGraphAdaptor<const ListGraph> rga(g);
     77   return algorithm2(rga);
    7878   }
    7979   \endcode
Note: See TracChangeset for help on using the changeset viewer.