Changes in lemon/capacity_scaling.h [1297:c0c2f5c87aa6:1298:a78e5b779b69] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/capacity_scaling.h
r1297 r1298 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-201 05 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 67 67 /// \ref CapacityScaling implements the capacity scaling version 68 68 /// of the successive shortest path algorithm for finding a 69 /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows, 70 /// \ref edmondskarp72theoretical. It is an efficient dual 71 /// solution method. 69 /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows, 70 /// \cite edmondskarp72theoretical. It is an efficient dual 71 /// solution method, which runs in polynomial time 72 /// \f$O(m\log U (n+m)\log n)\f$, where <i>U</i> denotes the maximum 73 /// of node supply and arc capacity values. 72 74 /// 73 75 /// This algorithm is typically slower than \ref CostScaling and … … 117 119 typedef typename TR::Heap Heap; 118 120 119 /// The \ref CapacityScalingDefaultTraits "traits class" of the algorithm 121 /// \brief The \ref lemon::CapacityScalingDefaultTraits "traits class" 122 /// of the algorithm 120 123 typedef TR Traits; 121 124 … … 643 646 /// 644 647 /// This function returns the total cost of the found flow. 645 /// Its complexity is O( e).648 /// Its complexity is O(m). 646 649 /// 647 650 /// \note The return type of the function can be specified as a … … 835 838 return OPTIMAL; 836 839 } 837 840 838 841 // Check if the upper bound is greater than or equal to the lower bound 839 842 // on each forward arc.
Note: See TracChangeset
for help on using the changeset viewer.