Changeset 2037:32e4bebee616 in lemon-0.x for lemon/edmonds_karp.h

Timestamp:

04/04/06 19:43:23 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2676

Message:

Doxygen log corrections

doc of ResGraphAdaptor? has a bug in graph_adaptor.h

File:

• lemon/edmonds_karp.h (modified) (4 diffs)

lemon/edmonds_karp.h

@@ -102 +102 @@
     ///
     /// The constructor of the class. 
-    /// \param _graph The directed graph the algorithm runs on. 
-    /// \param _source The source node.
-    /// \param _target The target node.
-    /// \param _capacity The capacity of the edges. 
-    /// \param _flow The flow of the edges. 
-    /// \param _tolerance Tolerance class.
+    /// \param graph The directed graph the algorithm runs on. 
+    /// \param source The source node.
+    /// \param target The target node.
+    /// \param capacity The capacity of the edges. 
+    /// \param flow The flow of the edges. 
+    /// \param tolerance Tolerance class.
     /// Except the graph, all of these parameters can be reset by
     /// calling \ref source, \ref target, \ref capacityMap and \ref
@@ -253 +253 @@
     /// Sets \c cut to the characteristic vector of a minimum value cut
     /// It simply calls the minMinCut member.
+    /// \retval cut Write node bool map. 
     template <typename CutMap>
     void minCut(CutMap& cut) const {
@@ -263 +264 @@
     /// which is inclusionwise minimum. It is computed by processing a
     /// bfs from the source node \c source in the residual graph.  
+    /// \retval cut Write node bool map. 
     template <typename CutMap>
     void minMinCut(CutMap& cut) const {
@@ -284 +286 @@
     /// which is inclusionwise minimum. It is computed by processing a
     /// bfs from the source node \c source in the residual graph.  
+    /// \retval cut Write node bool map. 
     template <typename CutMap>
     void maxMinCut(CutMap& cut) const {