equal
deleted
inserted
replaced
35 ///value can be obtained by calling \ref flowValue(). The minimum |
35 ///value can be obtained by calling \ref flowValue(). The minimum |
36 ///value cut can be written into a \c node map of \c bools by |
36 ///value cut can be written into a \c node map of \c bools by |
37 ///calling \ref minCut. (\ref minMinCut and \ref maxMinCut writes |
37 ///calling \ref minCut. (\ref minMinCut and \ref maxMinCut writes |
38 ///the inclusionwise minimum and maximum of the minimum value |
38 ///the inclusionwise minimum and maximum of the minimum value |
39 ///cuts, resp.) |
39 ///cuts, resp.) |
40 ///\param Graph The undirected graph type the algorithm runs on. |
40 ///\param Graph The directed graph type the algorithm runs on. |
41 ///\param Num The number type of the capacities and the flow values. |
41 ///\param Num The number type of the capacities and the flow values. |
42 ///\param CapMap The type of the capacity map. |
42 ///\param CapMap The type of the capacity map. |
43 ///\param FlowMap The type of the flow map. |
43 ///\param FlowMap The type of the flow map. |
44 ///\author Marton Makai, Jacint Szabo |
44 ///\author Marton Makai, Jacint Szabo |
45 template <typename Graph, typename Num, |
45 template <typename Graph, typename Num, |