equal
deleted
inserted
replaced
110 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. |
110 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. |
111 /// |
111 /// |
112 /// The algorithm consists of two phases. After the first phase |
112 /// The algorithm consists of two phases. After the first phase |
113 /// the maximum flow value and the minimum cut is obtained. The |
113 /// the maximum flow value and the minimum cut is obtained. The |
114 /// second phase constructs a feasible maximum flow on each arc. |
114 /// second phase constructs a feasible maximum flow on each arc. |
|
115 /// |
|
116 /// \warning This implementation cannot handle infinite or very large |
|
117 /// capacities (e.g. the maximum value of \c CAP::Value). |
115 /// |
118 /// |
116 /// \tparam GR The type of the digraph the algorithm runs on. |
119 /// \tparam GR The type of the digraph the algorithm runs on. |
117 /// \tparam CAP The type of the capacity map. The default map |
120 /// \tparam CAP The type of the capacity map. The default map |
118 /// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
121 /// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
119 #ifdef DOXYGEN |
122 #ifdef DOXYGEN |