diff -r f973894da54e -r bb3d5e6f9fcb lemon/min_cut.h --- a/lemon/min_cut.h Fri Sep 29 11:26:29 2006 +0000 +++ b/lemon/min_cut.h Fri Sep 29 11:36:30 2006 +0000 @@ -830,18 +830,19 @@ /// \ingroup topology /// - /// \brief Calculates the min cut in an undirected graph. + /// \brief Calculates the minimum cut in an undirected graph. /// - /// Calculates the min cut in an undirected graph. - /// The algorithm separates the graph's nodes into two partitions with the - /// min sum of edge capacities between the two partitions. The - /// algorithm can be used to test the network reliability specifically - /// to test how many links have to be destroyed in the network to split it - /// at least two distinict subnetwork. + /// Calculates the minimum cut in an undirected graph with the + /// Nagamochi-Ibaraki algorithm. The algorithm separates the graph's + /// nodes into two partitions with the minimum sum of edge capacities + /// between the two partitions. The algorithm can be used to test + /// the network reliability specifically to test how many links have + /// to be destroyed in the network to split it at least two + /// distinict subnetwork. /// /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with - /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When - /// the neutral capacity map is used then it uses BucketHeap which + /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) + /// \f$. When capacity map is neutral then it uses BucketHeap which /// results \f$ O(ne) \f$ time complexity. #ifdef DOXYGEN template