Changeset 762:ece80147fb08 in lemon for lemon/preflow.h
 Timestamp:
 09/25/09 09:06:32 (10 years ago)
 Branch:
 default
 Parents:
 761:98a30824fe36 (diff), 759:6d5f547e5bfb (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/preflow.h
r736 r762 53 53 /// The type of the map that stores the flow values. 54 54 /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. 55 #ifdef DOXYGEN 56 typedef GR::ArcMap<Value> FlowMap; 57 #else 55 58 typedef typename Digraph::template ArcMap<Value> FlowMap; 59 #endif 56 60 57 61 /// \brief Instantiates a FlowMap. … … 68 72 /// The elevator type used by Preflow algorithm. 69 73 /// 70 /// \sa Elevator 71 /// \sa LinkedElevator 72 typedef LinkedElevator<Digraph, typename Digraph::Node> Elevator; 74 /// \sa Elevator, LinkedElevator 75 #ifdef DOXYGEN 76 typedef lemon::Elevator<GR, GR::Node> Elevator; 77 #else 78 typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator; 79 #endif 73 80 74 81 /// \brief Instantiates an Elevator. … … 392 399 /// The simplest way to execute the preflow algorithm is to use 393 400 /// \ref run() or \ref runMinCut().\n 394 /// If you need morecontrol on the initial solution or the execution,395 /// first you have to call one of the \ref init() functions, then401 /// If you need better control on the initial solution or the execution, 402 /// you have to call one of the \ref init() functions first, then 396 403 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). 397 404 
lemon/preflow.h
r760 r762 105 105 /// "flow of maximum value" in a digraph. 106 106 /// The preflow algorithms are the fastest known maximum 107 /// flow algorithms. The current implementation use a mixture of the107 /// flow algorithms. The current implementation uses a mixture of the 108 108 /// \e "highest label" and the \e "bound decrease" heuristics. 109 109 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. … … 379 379 } 380 380 381 /// \brief Sets the tolerance used by algorithm. 382 /// 383 /// Sets the tolerance used by algorithm. 384 Preflow& tolerance(const Tolerance& tolerance) const { 381 /// \brief Sets the tolerance used by the algorithm. 382 /// 383 /// Sets the tolerance object used by the algorithm. 384 /// \return <tt>(*this)</tt> 385 Preflow& tolerance(const Tolerance& tolerance) { 385 386 _tolerance = tolerance; 386 387 return *this; … … 389 390 /// \brief Returns a const reference to the tolerance. 390 391 /// 391 /// Returns a const reference to the tolerance. 392 /// Returns a const reference to the tolerance object used by 393 /// the algorithm. 392 394 const Tolerance& tolerance() const { 393 return tolerance;395 return _tolerance; 394 396 } 395 397
Note: See TracChangeset
for help on using the changeset viewer.