Changes in lemon/preflow.h [641:756a5ec551c8:715:ece80147fb08] in lemon1.2
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/preflow.h
r641 r715 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. … … 98 105 /// "flow of maximum value" in a digraph. 99 106 /// The preflow algorithms are the fastest known maximum 100 /// flow algorithms. The current implementation use a mixture of the107 /// flow algorithms. The current implementation uses a mixture of the 101 108 /// \e "highest label" and the \e "bound decrease" heuristics. 102 109 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. … … 372 379 } 373 380 374 /// \brief Sets the tolerance used by algorithm. 375 /// 376 /// Sets the tolerance used by algorithm. 377 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) { 378 386 _tolerance = tolerance; 379 387 return *this; … … 382 390 /// \brief Returns a const reference to the tolerance. 383 391 /// 384 /// Returns a const reference to the tolerance. 392 /// Returns a const reference to the tolerance object used by 393 /// the algorithm. 385 394 const Tolerance& tolerance() const { 386 return tolerance;395 return _tolerance; 387 396 } 388 397 … … 390 399 /// The simplest way to execute the preflow algorithm is to use 391 400 /// \ref run() or \ref runMinCut().\n 392 /// If you need morecontrol on the initial solution or the execution,393 /// 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 394 403 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). 395 404
Note: See TracChangeset
for help on using the changeset viewer.