Changeset 985:f63fd24c0aea in lemon for lemon/preflow.h
 Timestamp:
 06/25/10 05:54:56 (10 years ago)
 Branch:
 1.2
 Parents:
 978:cbf32bf95954 (diff), 982:bb70ad62c95f (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
r956 r985 577 577 _phase = true; 578 578 579 Node n = _level>highestActive(); 580 int level = _level>highestActiveLevel(); 581 while (n != INVALID) { 579 while (true) { 582 580 int num = _node_num; 583 581 584 while (num > 0 && n != INVALID) { 582 Node n = INVALID; 583 int level = 1; 584 585 while (num > 0) { 586 n = _level>highestActive(); 587 if (n == INVALID) goto first_phase_done; 588 level = _level>highestActiveLevel(); 589 num; 590 585 591 Value excess = (*_excess)[n]; 586 592 int new_level = _level>maxLevel(); … … 648 654 _level>deactivate(n); 649 655 } 650 651 n = _level>highestActive(); 652 level = _level>highestActiveLevel(); 656 } 657 658 num = _node_num * 20; 659 while (num > 0) { 660 while (level >= 0 && _level>activeFree(level)) { 661 level; 662 } 663 if (level == 1) { 664 n = _level>highestActive(); 665 level = _level>highestActiveLevel(); 666 if (n == INVALID) goto first_phase_done; 667 } else { 668 n = _level>activeOn(level); 669 } 653 670 num; 654 } 655 656 num = _node_num * 20; 657 while (num > 0 && n != INVALID) { 671 658 672 Value excess = (*_excess)[n]; 659 673 int new_level = _level>maxLevel(); … … 721 735 _level>deactivate(n); 722 736 } 723 724 while (level >= 0 && _level>activeFree(level)) { 725 level; 726 } 727 if (level == 1) { 728 n = _level>highestActive(); 729 level = _level>highestActiveLevel(); 730 } else { 731 n = _level>activeOn(level); 732 } 733 num; 734 } 735 } 737 } 738 } 739 first_phase_done:; 736 740 } 737 741 
lemon/preflow.h
r982 r985 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 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 GoldbergTarjan's \e preflow 97 104 /// \e pushrelabel 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$. … … 106 114 /// second phase constructs a feasible maximum flow on each arc. 107 115 /// 116 /// \warning This implementation cannot handle infinite or very large 117 /// capacities (e.g. the maximum value of \c CAP::Value). 118 /// 108 119 /// \tparam GR The type of the digraph the algorithm runs on. 109 120 /// \tparam CAP The type of the capacity map. The default map 110 121 /// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". 122 /// \tparam TR The traits class that defines various types used by the 123 /// algorithm. By default, it is \ref PreflowDefaultTraits 124 /// "PreflowDefaultTraits<GR, CAP>". 125 /// In most cases, this parameter should not be set directly, 126 /// consider to use the named template parameters instead. 111 127 #ifdef DOXYGEN 112 128 template <typename GR, typename CAP, typename TR> … … 258 274 /// able to automatically created by the algorithm (i.e. the 259 275 /// digraph and the maximum level should be passed to it). 260 /// However an external elevator object could also be passed to the276 /// However, an external elevator object could also be passed to the 261 277 /// algorithm with the \ref elevator(Elevator&) "elevator()" function 262 278 /// before calling \ref run() or \ref init(). … … 372 388 } 373 389 374 /// \brief Sets the tolerance used by algorithm. 375 /// 376 /// Sets the tolerance used by algorithm. 390 /// \brief Sets the tolerance used by the algorithm. 391 /// 392 /// Sets the tolerance object used by the algorithm. 393 /// \return <tt>(*this)</tt> 377 394 Preflow& tolerance(const Tolerance& tolerance) { 378 395 _tolerance = tolerance; … … 382 399 /// \brief Returns a const reference to the tolerance. 383 400 /// 384 /// Returns a const reference to the tolerance. 401 /// Returns a const reference to the tolerance object used by 402 /// the algorithm. 385 403 const Tolerance& tolerance() const { 386 404 return _tolerance; … … 390 408 /// The simplest way to execute the preflow algorithm is to use 391 409 /// \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, then410 /// If you need better control on the initial solution or the execution, 411 /// you have to call one of the \ref init() functions first, then 394 412 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). 395 413
Note: See TracChangeset
for help on using the changeset viewer.