equal
deleted
inserted
replaced
37 /// algorithm for finding a minimum cost flow. |
37 /// algorithm for finding a minimum cost flow. |
38 /// |
38 /// |
39 /// \note \ref lemon::MinCostFlow "MinCostFlow" is just an alias for |
39 /// \note \ref lemon::MinCostFlow "MinCostFlow" is just an alias for |
40 /// \ref lemon::NetworkSimplex "NetworkSimplex", wich is the most |
40 /// \ref lemon::NetworkSimplex "NetworkSimplex", wich is the most |
41 /// efficient implementation for the minimum cost flow problem in the |
41 /// efficient implementation for the minimum cost flow problem in the |
42 /// Lemon library according to our benchmark tests. |
42 /// LEMON library according to our benchmark tests. |
43 /// |
43 /// |
44 /// \note There are three implementations for the minimum cost flow |
44 /// \note There are three implementations for the minimum cost flow |
45 /// problem, that can be used in the same way. |
45 /// problem, that can be used in the same way. |
46 /// - \ref lemon::CapacityScaling "CapacityScaling" |
46 /// - \ref lemon::CapacityScaling "CapacityScaling" |
47 /// - \ref lemon::CycleCanceling "CycleCanceling" |
47 /// - \ref lemon::CycleCanceling "CycleCanceling" |