# Changeset 950:86613aa28a0c in lemon

Ignore:
Timestamp:
03/04/10 10:17:02 (12 years ago)
Branch:
default
Phase:
public
Message:

Fix documentation issues (#314)

File:
1 edited

### Legend:

Unmodified
 r948 /// /// The primal solution is multiplied by /// \ref MaxWeightedMatching::primalScale "2". /// \ref MaxFractionalMatching::primalScale "2". /// /// \tparam GR The undirected graph type the algorithm runs on. /// /// 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 /// \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. /// 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. /// \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. /// /// 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 /// 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. /// 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. /// \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.