| ... | ... |
@@ -113,6 +113,9 @@ |
| 113 | 113 |
/// the maximum flow value and the minimum cut is obtained. The |
| 114 | 114 |
/// second phase constructs a feasible maximum flow on each arc. |
| 115 | 115 |
/// |
| 116 |
/// \warning This implementation cannot handle infinite or very large |
|
| 117 |
/// capacities (e.g. the maximum value of \c CAP::Value). |
|
| 118 |
/// |
|
| 116 | 119 |
/// \tparam GR The type of the digraph the algorithm runs on. |
| 117 | 120 |
/// \tparam CAP The type of the capacity map. The default map |
| 118 | 121 |
/// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
0 comments (0 inline)