Changeset 2084:59769591eb60 in lemon0.x for doc/graphadaptors.dox
 Timestamp:
 05/15/06 11:49:51 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2749
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphadaptors.dox
r1949 r2084 37 37 \code 38 38 ListGraph g; 39 RevGraphAdaptor<ListGraph> rg w(g);40 int result=algorithm(rg w);39 RevGraphAdaptor<ListGraph> rga(g); 40 int result=algorithm(rga); 41 41 \endcode 42 42 After running the algorithm, the original graph \c g … … 59 59 meaningless. This means that the concepts that they are models of depend 60 60 on the graph adaptor, and the wrapped graph(s). 61 If an edge of \c rg wis deleted, this is carried out by61 If an edge of \c rga is deleted, this is carried out by 62 62 deleting the corresponding edge of \c g, thus the adaptor modifies the 63 63 original graph. … … 74 74 \code 75 75 int algorithm1(const ListGraph& g) { 76 RevGraphAdaptor<const ListGraph> rg w(g);77 return algorithm2(rg w);76 RevGraphAdaptor<const ListGraph> rga(g); 77 return algorithm2(rga); 78 78 } 79 79 \endcode
Note: See TracChangeset
for help on using the changeset viewer.