equal
deleted
inserted
replaced
41 /// edges should be passed to the algorithm through the |
41 /// edges should be passed to the algorithm through the |
42 /// constructor. |
42 /// constructor. |
43 /// |
43 /// |
44 /// The time complexity of the algorithm is \f$ O(n * e^2) \f$ in |
44 /// The time complexity of the algorithm is \f$ O(n * e^2) \f$ in |
45 /// worst case. Always try the preflow algorithm instead of this if |
45 /// worst case. Always try the preflow algorithm instead of this if |
46 /// you does not have some additional reason than to compute the |
46 /// you just want to compute the optimal flow. |
47 /// optimal flow which has \f$ O(n^3) \f$ time complexity. |
|
48 /// |
47 /// |
49 /// \param _Graph The directed graph type the algorithm runs on. |
48 /// \param _Graph The directed graph type the algorithm runs on. |
50 /// \param _Number The number type of the capacities and the flow values. |
49 /// \param _Number The number type of the capacities and the flow values. |
51 /// \param _CapacityMap The capacity map type. |
50 /// \param _CapacityMap The capacity map type. |
52 /// \param _FlowMap The flow map type. |
51 /// \param _FlowMap The flow map type. |