49 /// algorithms for finding a \ref min_cost_flow "minimum cost flow" |
49 /// algorithms for finding a \ref min_cost_flow "minimum cost flow" |
50 /// \ref amo93networkflows, \ref klein67primal, |
50 /// \ref amo93networkflows, \ref klein67primal, |
51 /// \ref goldberg89cyclecanceling. |
51 /// \ref goldberg89cyclecanceling. |
52 /// The most efficent one is the \ref CANCEL_AND_TIGHTEN |
52 /// The most efficent one is the \ref CANCEL_AND_TIGHTEN |
53 /// "Cancel-and-Tighten" algorithm, thus it is the default method. |
53 /// "Cancel-and-Tighten" algorithm, thus it is the default method. |
54 /// It runs in strongly polynomial time, but in practice, it is typically |
54 /// It runs in strongly polynomial time O(n<sup>2</sup>e<sup>2</sup>log(n)), |
55 /// orders of magnitude slower than the scaling algorithms and |
55 /// but in practice, it is typically orders of magnitude slower than |
56 /// \ref NetworkSimplex. |
56 /// the scaling algorithms and \ref NetworkSimplex. |
57 /// (For more information, see \ref min_cost_flow_algs "the module page".) |
57 /// (For more information, see \ref min_cost_flow_algs "the module page".) |
58 /// |
58 /// |
59 /// Most of the parameters of the problem (except for the digraph) |
59 /// Most of the parameters of the problem (except for the digraph) |
60 /// can be given using separate functions, and the algorithm can be |
60 /// can be given using separate functions, and the algorithm can be |
61 /// executed using the \ref run() function. If some parameters are not |
61 /// executed using the \ref run() function. If some parameters are not |