equal
deleted
inserted
replaced
42 /// For the detailed documentation of this class see |
42 /// For the detailed documentation of this class see |
43 /// \ref NetworkSimplex. |
43 /// \ref NetworkSimplex. |
44 /// |
44 /// |
45 /// There are four implementations for the minimum cost flow problem, |
45 /// There are four implementations for the minimum cost flow problem, |
46 /// which can be used exactly the same way. |
46 /// which can be used exactly the same way. |
47 /// - \ref CapacityScaling The capacity scaling algorithm. |
47 /// - \ref CapacityScaling |
48 /// - \ref CostScaling The cost scaling algorithm. |
48 /// - \ref CostScaling |
49 /// - \ref CycleCanceling A cycle-canceling algorithm. |
49 /// - \ref CycleCanceling |
50 /// - \ref NetworkSimplex The network simplex algorithm. |
50 /// - \ref NetworkSimplex |
51 /// |
51 /// |
52 /// \tparam Graph The directed graph type the algorithm runs on. |
52 /// \tparam Graph The directed graph type the algorithm runs on. |
53 /// \tparam LowerMap The type of the lower bound map. |
53 /// \tparam LowerMap The type of the lower bound map. |
54 /// \tparam CapacityMap The type of the capacity (upper bound) map. |
54 /// \tparam CapacityMap The type of the capacity (upper bound) map. |
55 /// \tparam CostMap The type of the cost (length) map. |
55 /// \tparam CostMap The type of the cost (length) map. |