equal
deleted
inserted
replaced
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" \ref amo93networkflows, |
69 /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows, |
70 /// \ref edmondskarp72theoretical. It is an efficient dual |
70 /// \ref edmondskarp72theoretical. It is an efficient dual |
71 /// solution method. |
71 /// solution method, which runs in polynomial time |
|
72 /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum |
|
73 /// of node supply and arc capacity values. |
72 /// |
74 /// |
73 /// This algorithm is typically slower than \ref CostScaling and |
75 /// This algorithm is typically slower than \ref CostScaling and |
74 /// \ref NetworkSimplex, but in special cases, it can be more |
76 /// \ref NetworkSimplex, but in special cases, it can be more |
75 /// efficient than them. |
77 /// efficient than them. |
76 /// (For more information, see \ref min_cost_flow_algs "the module page".) |
78 /// (For more information, see \ref min_cost_flow_algs "the module page".) |