lemon-main: comparison lemon/fractional

equal deleted inserted replaced

-:1ec5754fa4c3
+:a3f5c5ba7a87
 /// The algorithm can be executed with the run() function.  After it
 /// the matching (the primal solution) and the barrier (the dual
 /// solution) can be obtained using the query functions.
 ///
 /// The primal solution is multiplied by
-/// \ref MaxWeightedMatching::primalScale "2".
+/// \ref MaxFractionalMatching::primalScale "2".
 ///
 /// \tparam GR The undirected graph type the algorithm runs on.
 #ifdef DOXYGEN
 template <typename GR, typename TR>
 #else
 /// \ingroup matching
 ///
 /// \brief Weighted fractional matching in general graphs
 ///
 /// This class provides an efficient implementation of fractional
-/// matching algorithm. The implementation is based on extensive use
+/// matching algorithm. The implementation uses priority queues and
-/// of priority queues and provides \f$O(nm\log n)\f$ time
+/// provides \f$O(nm\log n)\f$ time complexity.
-/// complexity.
 ///
 /// The maximum weighted fractional matching is a relaxation of the
 /// maximum weighted matching problem where the odd set constraints
 /// are omitted.
 /// It can be formulated with the following linear program.
 /// proof of the optimality. The solution of the dual problem can be
 /// used to check the result of the algorithm. The dual linear
 /// problem is the following.
 /// \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.
 /// After it the matching (the primal solution) and the dual solution
 /// can be obtained using the query functions.
 ///
 /// If the value type is integer, then the primal and the dual
 /// solutions are multiplied by
-/// \ref MaxWeightedMatching::primalScale "2" and
+/// \ref MaxWeightedFractionalMatching::primalScale "2" and
-/// \ref MaxWeightedMatching::dualScale "4" respectively.
+/// \ref MaxWeightedFractionalMatching::dualScale "4" respectively.
 ///
 /// \tparam GR The undirected graph type the algorithm runs on.
 /// \tparam WM The type edge weight map. The default type is
 /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<int>".
 #ifdef DOXYGEN
 }
 }
 /// \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.
 /// \code
 ///   mwfm.init();
 ///   mwfm.start();
 /// \ingroup matching
 ///
 /// \brief Weighted fractional perfect matching in general graphs
 ///
 /// This class provides an efficient implementation of fractional
-/// matching algorithm. The implementation is based on extensive use
+/// matching algorithm. The implementation uses priority queues and
-/// of priority queues and provides \f$O(nm\log n)\f$ time
+/// provides \f$O(nm\log n)\f$ time complexity.
-/// complexity.
 ///
 /// The maximum weighted fractional perfect matching is a relaxation
 /// of the maximum weighted perfect matching problem where the odd
 /// set constraints are omitted.
 /// It can be formulated with the following linear program.
 /// The algorithm calculates an optimal fractional matching and a
 /// proof of the optimality. The solution of the dual problem can be
 /// used to check the result of the algorithm. The dual linear
 /// 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.
 /// After it the matching (the primal solution) and the dual solution
 /// can be obtained using the query functions.
 /// If the value type is integer, then the primal and the dual
 /// solutions are multiplied by
-/// \ref MaxWeightedMatching::primalScale "2" and
+/// \ref MaxWeightedPerfectFractionalMatching::primalScale "2" and
-/// \ref MaxWeightedMatching::dualScale "4" respectively.
+/// \ref MaxWeightedPerfectFractionalMatching::dualScale "4" respectively.
 ///
 /// \tparam GR The undirected graph type the algorithm runs on.
 /// \tparam WM The type edge weight map. The default type is
 /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<int>".
 #ifdef DOXYGEN
 return true;
 }
 /// \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.
 /// \code
 ///   mwpfm.init();
 ///   mwpfm.start();

changeset 871	86613aa28a0c
parent 869	636dadefe1e6
child 872	41d7ac528c3a