Changeset 1946:17eb3eaad9f8 in lemon0.x for lemon/graph_adaptor.h
 Timestamp:
 02/02/06 18:43:24 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2521
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/graph_adaptor.h
r1909 r1946 189 189 /// suppose that a graph instange \c g of type 190 190 /// \c ListGraph implements \f$G\f$. 191 /// 191 ///\code 192 192 /// ListGraph g; 193 /// 193 ///\endcode 194 194 /// For each directed edge 195 195 /// \f$e\in A\f$, let \f$\bar e\f$ denote the edge obtained by … … 200 200 /// reversing the orientation of its edges. The following code shows how 201 201 /// such an instance can be constructed. 202 /// 202 ///\code 203 203 /// RevGraphAdaptor<ListGraph> gw(g); 204 /// 204 ///\endcode 205 205 ///\author Marton Makai 206 206 207 template<typename _Graph> 207 208 class RevGraphAdaptor : … … 1279 1280 /// For blocking flows. 1280 1281 1281 ///\warning Graph adaptors are in even more experimental state than the other 1282 ///\warning Graph adaptors are in even more 1283 ///experimental state than the other 1282 1284 ///parts of the lib. Use them at you own risk. 1283 1285 /// 1284 /// This graph adaptor is used for onthefly 1285 /// Dinits blocking flow computations. 1286 /// For each node, an outedge is stored which is used when the 1287 /// \code 1288 /// OutEdgeIt& first(OutEdgeIt&, const Node&) 1289 /// \endcode 1290 /// is called. 1286 ///This graph adaptor is used for onthefly 1287 ///Dinits blocking flow computations. 1288 ///For each node, an outedge is stored which is used when the 1289 ///\code OutEdgeIt& first(OutEdgeIt&, const Node&)\endcode 1290 ///is called. 1291 1291 /// 1292 /// \author Marton Makai 1292 ///\author Marton Makai 1293 /// 1293 1294 template <typename _Graph, typename FirstOutEdgesMap> 1294 1295 class ErasingFirstGraphAdaptor :
Note: See TracChangeset
for help on using the changeset viewer.