Changeset 950:86613aa28a0c in lemon

Timestamp:

03/04/10 10:17:02 (15 years ago)

Author:

Balazs Dezso <deba@…>

Branch:

default

Phase:

public

Message:

Fix documentation issues (#314)

File:

• lemon/fractional_matching.h (modified) (9 diffs)

lemon/fractional_matching.h

@@ -112 +112 @@
   ///
   /// The primal solution is multiplied by
-  /// \ref MaxWeightedMatching::primalScale "2".
+  /// \ref MaxFractionalMatching::primalScale "2".
   ///
   /// \tparam GR The undirected graph type the algorithm runs on.
@@ -633 +633 @@
   ///
   /// This class provides an efficient implementation of fractional
-  /// matching algorithm. The implementation is based on extensive use
-  /// of priority queues and provides \f$O(nm\log n)\f$ time
-  /// complexity.
+  /// matching algorithm. The implementation uses priority queues and
+  /// provides \f$O(nm\log n)\f$ time complexity.
   ///
   /// The maximum weighted fractional matching is a relaxation of the
@@ -654 +653 @@
   /// \f[ y_u + y_v \ge w_{uv} \quad \forall uv\in E\f]
   /// \f[y_u \ge 0 \quad \forall u \in V\f]
-  /// \f[\min \sum_{u \in V}y_u \f] ///
+  /// \f[\min \sum_{u \in V}y_u \f]
   ///
   /// The algorithm can be executed with the run() function.
@@ -662 +661 @@
   /// If the value type is integer, then the primal and the dual
   /// solutions are multiplied by
-  /// \ref MaxWeightedMatching::primalScale "2" and
-  /// \ref MaxWeightedMatching::dualScale "4" respectively.
+  /// \ref MaxWeightedFractionalMatching::primalScale "2" and
+  /// \ref MaxWeightedFractionalMatching::dualScale "4" respectively.
   ///
   /// \tparam GR The undirected graph type the algorithm runs on.
@@ -1271 +1270 @@
     /// \brief Run the algorithm.
     ///
-    /// This method runs the \c %MaxWeightedMatching algorithm.
+    /// This method runs the \c %MaxWeightedFractionalMatching algorithm.
     ///
     /// \note mwfm.run() is just a shortcut of the following code.
@@ -1401 +1400 @@
   ///
   /// This class provides an efficient implementation of fractional
-  /// matching algorithm. The implementation is based on extensive use
-  /// of priority queues and provides \f$O(nm\log n)\f$ time
-  /// complexity.
+  /// matching algorithm. The implementation uses priority queues and
+  /// provides \f$O(nm\log n)\f$ time complexity.
   ///
   /// The maximum weighted fractional perfect matching is a relaxation
@@ -1421 +1419 @@
   /// problem is the following.
   /// \f[ y_u + y_v \ge w_{uv} \quad \forall uv\in E\f]
-  /// \f[\min \sum_{u \in V}y_u \f] ///
+  /// \f[\min \sum_{u \in V}y_u \f]
   ///
   /// The algorithm can be executed with the run() function.
@@ -1429 +1427 @@
   /// If the value type is integer, then the primal and the dual
   /// solutions are multiplied by
-  /// \ref MaxWeightedMatching::primalScale "2" and
-  /// \ref MaxWeightedMatching::dualScale "4" respectively.
+  /// \ref MaxWeightedPerfectFractionalMatching::primalScale "2" and
+  /// \ref MaxWeightedPerfectFractionalMatching::dualScale "4" respectively.
   ///
   /// \tparam GR The undirected graph type the algorithm runs on.
@@ -2006 +2004 @@
     /// \brief Run the algorithm.
     ///
-    /// This method runs the \c %MaxWeightedMatching algorithm.
+    /// This method runs the \c %MaxWeightedPerfectFractionalMatching 
+    /// algorithm.
     ///
     /// \note mwfm.run() is just a shortcut of the following code.