equal
deleted
inserted
replaced
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 netaux 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 netaux to split it |
840 /// at least two distinict subnetaux. |
840 /// at least two distinict subnetaux. |
841 /// |
841 /// |
842 /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci |
842 /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with |
843 /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity |
843 /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When |
844 /// map is used then it uses BucketHeap which results O(n*e) time complexity. |
844 /// the neutral capacity map is used then it uses BucketHeap which |
|
845 /// results \f$ O(ne) \f$ time complexity. |
845 #ifdef DOXYGEN |
846 #ifdef DOXYGEN |
846 template <typename _Graph, typename _CapacityMap, typename _Traits> |
847 template <typename _Graph, typename _CapacityMap, typename _Traits> |
847 #else |
848 #else |
848 template <typename _Graph = ListUGraph, |
849 template <typename _Graph = ListUGraph, |
849 typename _CapacityMap = typename _Graph::template UEdgeMap<int>, |
850 typename _CapacityMap = typename _Graph::template UEdgeMap<int>, |