# Changeset 2273:507232469f5e in lemon-0.x for lemon

Ignore:
Timestamp:
10/30/06 17:12:44 (13 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3036
Message:

Small bugs in the documentation.

File:
1 edited

### Legend:

Unmodified
 r2228 /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs. /// /// Hao-Orlin calculates a minimum cut in a directed graph \f$/// D=(V,A) \f$. It takes a fixed node \f$source \in V \f$ and consists /// Hao-Orlin calculates a minimum cut in a directed graph /// \f$D=(V,A) \f$. It takes a fixed node \f$source \in V \f$ and consists /// of two phases: in the first phase it determines a minimum cut /// with \f$source \f$ on the source-side (i.e. a set \f$X\subsetneq V /// \f$ with \f$source \in X \f$ and minimal out-degree) and in the /// with \f$source \f$ on the source-side (i.e. a set \f$X\subsetneq V \f$ /// with \f$source \in X \f$ and minimal out-degree) and in the /// second phase it determines a minimum cut with \f$source \f$ on the /// sink-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \notin X \f$ /// network reliability. For an undirected graph with \f$n \f$ /// nodes and \f$e \f$ edges you can use the algorithm of Nagamochi /// and Ibaraki which solves the undirected problem in \f$O(ne + /// n^2 \log(n)) \f$ time: it is implemented in the MinCut algorithm /// and Ibaraki which solves the undirected problem in /// \f$O(ne + n^2 \log(n)) \f$ time: it is implemented in the MinCut /// algorithm /// class. /// /// /// \brief Calculates a minimum cut with \f$source \f$ on the /// source-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \in X /// \f$ and minimal out-degree). /// source-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \in X \f$ /// and minimal out-degree). void calculateOut() { for (NodeIt it(*_graph); it != INVALID; ++it) { /// /// \brief Calculates a minimum cut with \f$source \f$ on the /// source-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \in X /// \f$ and minimal out-degree). The \c target is the initial target /// source-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \in X \f$ /// and minimal out-degree). The \c target is the initial target /// for the push-relabel algorithm. void calculateOut(const Node& target) { /// /// \brief Calculates a minimum cut with \f$source \f$ on the /// sink-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \notin X /// \f$ and minimal out-degree). /// sink-side (i.e. a set \f$X\subsetneq V \f$ with /// \f$source \notin X \f$ /// and minimal out-degree). void calculateIn() { for (NodeIt it(*_graph); it != INVALID; ++it) { /// /// \brief Calculates a minimum cut with \f$source \f$ on the /// sink-side (i.e. a set \f$X\subsetneq V \f$ with \f$source \notin /// X \f$ and minimal out-degree).  The \c target is the initial /// sink-side (i.e. a set \f$X\subsetneq V /// \f$ with \f$source \notin X \f$ and minimal out-degree). /// The \c target is the initial /// target for the push-relabel algorithm. void calculateIn(const Node& target) {