Changeset 2037:32e4bebee616 in lemon0.x for lemon/edmonds_karp.h
 Timestamp:
 04/04/06 19:43:23 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2676
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/edmonds_karp.h
r2036 r2037 102 102 /// 103 103 /// The constructor of the class. 104 /// \param _graph The directed graph the algorithm runs on.105 /// \param _source The source node.106 /// \param _target The target node.107 /// \param _capacity The capacity of the edges.108 /// \param _flow The flow of the edges.109 /// \param _tolerance Tolerance class.104 /// \param graph The directed graph the algorithm runs on. 105 /// \param source The source node. 106 /// \param target The target node. 107 /// \param capacity The capacity of the edges. 108 /// \param flow The flow of the edges. 109 /// \param tolerance Tolerance class. 110 110 /// Except the graph, all of these parameters can be reset by 111 111 /// calling \ref source, \ref target, \ref capacityMap and \ref … … 253 253 /// Sets \c cut to the characteristic vector of a minimum value cut 254 254 /// It simply calls the minMinCut member. 255 /// \retval cut Write node bool map. 255 256 template <typename CutMap> 256 257 void minCut(CutMap& cut) const { … … 263 264 /// which is inclusionwise minimum. It is computed by processing a 264 265 /// bfs from the source node \c source in the residual graph. 266 /// \retval cut Write node bool map. 265 267 template <typename CutMap> 266 268 void minMinCut(CutMap& cut) const { … … 284 286 /// which is inclusionwise minimum. It is computed by processing a 285 287 /// bfs from the source node \c source in the residual graph. 288 /// \retval cut Write node bool map. 286 289 template <typename CutMap> 287 290 void maxMinCut(CutMap& cut) const {
Note: See TracChangeset
for help on using the changeset viewer.