equal
deleted
inserted
replaced
39 /// \brief Implementation of the primal Network Simplex algorithm |
39 /// \brief Implementation of the primal Network Simplex algorithm |
40 /// for finding a \ref min_cost_flow "minimum cost flow". |
40 /// for finding a \ref min_cost_flow "minimum cost flow". |
41 /// |
41 /// |
42 /// \ref NetworkSimplex implements the primal Network Simplex algorithm |
42 /// \ref NetworkSimplex implements the primal Network Simplex algorithm |
43 /// for finding a \ref min_cost_flow "minimum cost flow" |
43 /// for finding a \ref min_cost_flow "minimum cost flow" |
44 /// \ref amo93networkflows, \ref dantzig63linearprog, |
44 /// \cite amo93networkflows, \cite dantzig63linearprog, |
45 /// \ref kellyoneill91netsimplex. |
45 /// \cite kellyoneill91netsimplex. |
46 /// This algorithm is a highly efficient specialized version of the |
46 /// This algorithm is a highly efficient specialized version of the |
47 /// linear programming simplex method directly for the minimum cost |
47 /// linear programming simplex method directly for the minimum cost |
48 /// flow problem. |
48 /// flow problem. |
49 /// |
49 /// |
50 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest |
50 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest |