Changes in lemon/hao_orlin.h [1019:234d635ad721:956:141f9c0db4a3] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/hao_orlin.h
r1019 r956 54 54 /// preflow push-relabel algorithm. Our implementation calculates 55 55 /// the minimum cut in \f$ O(n^2\sqrt{m}) \f$ time (we use the 56 /// highest-label rule), or in \f$O(nm)\f$ for unit capacities. A notable57 /// use of this algorithm istesting network reliability.56 /// highest-label rule), or in \f$O(nm)\f$ for unit capacities. The 57 /// purpose of such algorithm is e.g. testing network reliability. 58 58 /// 59 59 /// For an undirected graph you can run just the first phase of the … … 913 913 /// source-side (i.e. a set \f$ X\subsetneq V \f$ with 914 914 /// \f$ source \in X \f$ and minimal outgoing capacity). 915 /// It updates the stored cut if (and only if) the newly found one916 /// is better.917 915 /// 918 916 /// \pre \ref init() must be called before using this function. … … 927 925 /// sink-side (i.e. a set \f$ X\subsetneq V \f$ with 928 926 /// \f$ source \notin X \f$ and minimal outgoing capacity). 929 /// It updates the stored cut if (and only if) the newly found one930 /// is better.931 927 /// 932 928 /// \pre \ref init() must be called before using this function. … … 938 934 /// \brief Run the algorithm. 939 935 /// 940 /// This function runs the algorithm. It chooses source node,941 /// then calls \ref init(), \ref calculateOut()936 /// This function runs the algorithm. It finds nodes \c source and 937 /// \c target arbitrarily and then calls \ref init(), \ref calculateOut() 942 938 /// and \ref calculateIn(). 943 939 void run() { … … 949 945 /// \brief Run the algorithm. 950 946 /// 951 /// This function runs the algorithm. It calls \ref init(),952 /// \ref calculateOut() and \ref calculateIn() with the given953 /// source node.947 /// This function runs the algorithm. It uses the given \c source node, 948 /// finds a proper \c target node and then calls the \ref init(), 949 /// \ref calculateOut() and \ref calculateIn(). 954 950 void run(const Node& s) { 955 951 init(s); … … 970 966 /// \brief Return the value of the minimum cut. 971 967 /// 972 /// This function returns the value of the best cut found by the 973 /// previously called \ref run(), \ref calculateOut() or \ref 974 /// calculateIn(). 968 /// This function returns the value of the minimum cut. 975 969 /// 976 970 /// \pre \ref run(), \ref calculateOut() or \ref calculateIn() … … 983 977 /// \brief Return a minimum cut. 984 978 /// 985 /// This function gives the best cut found by the 986 /// previously called \ref run(), \ref calculateOut() or \ref 987 /// calculateIn(). 988 /// 989 /// It sets \c cutMap to the characteristic vector of the found 990 /// minimum value cut - a non-empty set \f$ X\subsetneq V \f$ 991 /// of minimum outgoing capacity (i.e. \c cutMap will be \c true exactly 979 /// This function sets \c cutMap to the characteristic vector of a 980 /// minimum value cut: it will give a non-empty set \f$ X\subsetneq V \f$ 981 /// with minimal outgoing capacity (i.e. \c cutMap will be \c true exactly 992 982 /// for the nodes of \f$ X \f$). 993 983 ///
Note: See TracChangeset
for help on using the changeset viewer.