equal
deleted
inserted
replaced
88 |
88 |
89 /// \brief Implementation of the Cost Scaling algorithm for |
89 /// \brief Implementation of the Cost Scaling algorithm for |
90 /// finding a \ref min_cost_flow "minimum cost flow". |
90 /// finding a \ref min_cost_flow "minimum cost flow". |
91 /// |
91 /// |
92 /// \ref CostScaling implements a cost scaling algorithm that performs |
92 /// \ref CostScaling implements a cost scaling algorithm that performs |
93 /// push/augment and relabel operations for finding a minimum cost |
93 /// push/augment and relabel operations for finding a \ref min_cost_flow |
94 /// flow. It is an efficient primal-dual solution method, which |
94 /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation, |
|
95 /// \ref goldberg97efficient, \ref bunnagel98efficient. |
|
96 /// It is a highly efficient primal-dual solution method, which |
95 /// can be viewed as the generalization of the \ref Preflow |
97 /// can be viewed as the generalization of the \ref Preflow |
96 /// "preflow push-relabel" algorithm for the maximum flow problem. |
98 /// "preflow push-relabel" algorithm for the maximum flow problem. |
97 /// |
99 /// |
98 /// Most of the parameters of the problem (except for the digraph) |
100 /// Most of the parameters of the problem (except for the digraph) |
99 /// can be given using separate functions, and the algorithm can be |
101 /// can be given using separate functions, and the algorithm can be |