Changes in lemon/preflow.h [688:756a5ec551c8:802:134852d7fb0a] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/preflow.h
r688 r802 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. … … 96 103 /// This class provides an implementation of Goldberg-Tarjan's \e preflow 97 104 /// \e push-relabel algorithm producing a \ref max_flow 98 /// "flow of maximum value" in a digraph. 105 /// "flow of maximum value" in a digraph \ref clrs01algorithms, 106 /// \ref amo93networkflows, \ref goldberg88newapproach. 99 107 /// The preflow algorithms are the fastest known maximum 100 /// flow algorithms. The current implementation use a mixture of the108 /// flow algorithms. The current implementation uses a mixture of the 101 109 /// \e "highest label" and the \e "bound decrease" heuristics. 102 110 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. … … 372 380 } 373 381 374 /// \brief Sets the tolerance used by algorithm. 375 /// 376 /// Sets the tolerance used by algorithm. 377 Preflow& tolerance(const Tolerance& tolerance) const { 382 /// \brief Sets the tolerance used by the algorithm. 383 /// 384 /// Sets the tolerance object used by the algorithm. 385 /// \return <tt>(*this)</tt> 386 Preflow& tolerance(const Tolerance& tolerance) { 378 387 _tolerance = tolerance; 379 388 return *this; … … 382 391 /// \brief Returns a const reference to the tolerance. 383 392 /// 384 /// Returns a const reference to the tolerance. 393 /// Returns a const reference to the tolerance object used by 394 /// the algorithm. 385 395 const Tolerance& tolerance() const { 386 return tolerance;396 return _tolerance; 387 397 } 388 398 … … 390 400 /// The simplest way to execute the preflow algorithm is to use 391 401 /// \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, then402 /// If you need better control on the initial solution or the execution, 403 /// you have to call one of the \ref init() functions first, then 394 404 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). 395 405
Note: See TracChangeset
for help on using the changeset viewer.