equal
deleted
inserted
replaced
44 /// this edge from the tree determine the corresponding minimum cut. |
44 /// this edge from the tree determine the corresponding minimum cut. |
45 /// Therefore once this tree is computed, the minimum cut between any pair |
45 /// Therefore once this tree is computed, the minimum cut between any pair |
46 /// of nodes can easily be obtained. |
46 /// of nodes can easily be obtained. |
47 /// |
47 /// |
48 /// The algorithm calculates \e n-1 distinct minimum cuts (currently with |
48 /// The algorithm calculates \e n-1 distinct minimum cuts (currently with |
49 /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{e})\f$ overall |
49 /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{m})\f$ overall |
50 /// time complexity. It calculates a rooted Gomory-Hu tree. |
50 /// time complexity. It calculates a rooted Gomory-Hu tree. |
51 /// The structure of the tree and the edge weights can be |
51 /// The structure of the tree and the edge weights can be |
52 /// obtained using \c predNode(), \c predValue() and \c rootDist(). |
52 /// obtained using \c predNode(), \c predValue() and \c rootDist(). |
53 /// The functions \c minCutMap() and \c minCutValue() calculate |
53 /// The functions \c minCutMap() and \c minCutValue() calculate |
54 /// the minimum cut and the minimum cut value between any two nodes |
54 /// the minimum cut and the minimum cut value between any two nodes |