... | ... |
@@ -818,13 +818,13 @@ |
818 | 818 |
/// \name Execution control |
819 | 819 |
/// The simplest way to execute the algorithm is to use |
820 | 820 |
/// one of the member functions called \c run(...). |
821 | 821 |
/// \n |
822 | 822 |
/// If you need more control on the execution, |
823 | 823 |
/// first you must call \ref init(), then the \ref calculateIn() or |
824 |
/// \ref |
|
824 |
/// \ref calculateOut() functions. |
|
825 | 825 |
|
826 | 826 |
/// @{ |
827 | 827 |
|
828 | 828 |
/// \brief Initializes the internal data structures. |
829 | 829 |
/// |
830 | 830 |
/// Initializes the internal data structures. It creates |
... | ... |
@@ -880,24 +880,24 @@ |
880 | 880 |
|
881 | 881 |
|
882 | 882 |
/// \brief Calculates a minimum cut with \f$ source \f$ on the |
883 | 883 |
/// source-side. |
884 | 884 |
/// |
885 | 885 |
/// Calculates a minimum cut with \f$ source \f$ on the |
886 |
/// source-side (i.e. a set \f$ X\subsetneq V \f$ with \f$ source |
|
887 |
/// \in X \f$ and minimal out-degree). |
|
886 |
/// source-side (i.e. a set \f$ X\subsetneq V \f$ with |
|
887 |
/// \f$ source \in X \f$ and minimal out-degree). |
|
888 | 888 |
void calculateOut() { |
889 | 889 |
findMinCutOut(); |
890 | 890 |
} |
891 | 891 |
|
892 | 892 |
/// \brief Calculates a minimum cut with \f$ source \f$ on the |
893 | 893 |
/// target-side. |
894 | 894 |
/// |
895 | 895 |
/// Calculates a minimum cut with \f$ source \f$ on the |
896 |
/// target-side (i.e. a set \f$ X\subsetneq V \f$ with \f$ source |
|
897 |
/// \in X \f$ and minimal out-degree). |
|
896 |
/// target-side (i.e. a set \f$ X\subsetneq V \f$ with |
|
897 |
/// \f$ source \in X \f$ and minimal out-degree). |
|
898 | 898 |
void calculateIn() { |
899 | 899 |
findMinCutIn(); |
900 | 900 |
} |
901 | 901 |
|
902 | 902 |
|
903 | 903 |
/// \brief Runs the algorithm. |
0 comments (0 inline)