equal
deleted
inserted
replaced
64 /// \brief Implementation of the Capacity Scaling algorithm for |
64 /// \brief Implementation of the Capacity Scaling algorithm for |
65 /// finding a \ref min_cost_flow "minimum cost flow". |
65 /// finding a \ref min_cost_flow "minimum cost flow". |
66 /// |
66 /// |
67 /// \ref CapacityScaling implements the capacity scaling version |
67 /// \ref CapacityScaling implements the capacity scaling version |
68 /// of the successive shortest path algorithm for finding a |
68 /// of the successive shortest path algorithm for finding a |
69 /// \ref min_cost_flow "minimum cost flow". It is an efficient dual |
69 /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows, |
|
70 /// \ref edmondskarp72theoretical. It is an efficient dual |
70 /// solution method. |
71 /// solution method. |
71 /// |
72 /// |
72 /// Most of the parameters of the problem (except for the digraph) |
73 /// Most of the parameters of the problem (except for the digraph) |
73 /// can be given using separate functions, and the algorithm can be |
74 /// can be given using separate functions, and the algorithm can be |
74 /// executed using the \ref run() function. If some parameters are not |
75 /// executed using the \ref run() function. If some parameters are not |