equal
deleted
inserted
replaced
831 /// \ingroup topology |
831 /// \ingroup topology |
832 /// |
832 /// |
833 /// \brief Calculates the min cut in an undirected graph. |
833 /// \brief Calculates the min cut in an undirected graph. |
834 /// |
834 /// |
835 /// Calculates the min cut in an undirected graph. |
835 /// Calculates the min cut in an undirected graph. |
836 /// The algorithm separates the graph's nodes to two partitions with the |
836 /// The algorithm separates the graph's nodes into two partitions with the |
837 /// min sum of edge capacities between the two partitions. The |
837 /// min sum of edge capacities between the two partitions. The |
838 /// algorithm can be used to test the netaux reliability specifically |
838 /// algorithm can be used to test the network reliability specifically |
839 /// to test how many links have to be destroyed in the netaux to split it |
839 /// to test how many links have to be destroyed in the network to split it |
840 /// at least two distinict subnetaux. |
840 /// at least two distinict subnetwork. |
841 /// |
841 /// |
842 /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with |
842 /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with |
843 /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When |
843 /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When |
844 /// the neutral capacity map is used then it uses BucketHeap which |
844 /// the neutral capacity map is used then it uses BucketHeap which |
845 /// results \f$ O(ne) \f$ time complexity. |
845 /// results \f$ O(ne) \f$ time complexity. |