Changeset - r918:86613aa28a0c
« 917:611205
919:41d7ac »
gravatar
deba@inf.elte.hu
deba@inf.elte.hu
Fix documentation issues (#314)
0 1 0
default
1 file changed with 14 insertions and 15 deletions:
lemon/fractional_matching.h
14
15
↑ Collapse diff ↑
lemon/fractional_matching.h
Show white space 6 line context
... ... 
@@ -113,3 +113,3 @@
113 113 
  /// The primal solution is multiplied by
114 
  /// \ref MaxWeightedMatching::primalScale "2".
114 
  /// \ref MaxFractionalMatching::primalScale "2".
115 115 
  ///
... ... 
@@ -634,5 +634,4 @@
634 634 
  /// This class provides an efficient implementation of fractional
635 
  /// matching algorithm. The implementation is based on extensive use
636 
  /// of priority queues and provides \f$O(nm\log n)\f$ time
637 
  /// complexity.
635 
  /// matching algorithm. The implementation uses priority queues and
636 
  /// provides \f$O(nm\log n)\f$ time complexity.
638 637 
  ///
... ... 
@@ -655,3 +654,3 @@
655 654 
  /// \f[y_u \ge 0 \quad \forall u \in V\f]
656 
  /// \f[\min \sum_{u \in V}y_u \f] ///
655 
  /// \f[\min \sum_{u \in V}y_u \f]
657 656 
  ///
... ... 
@@ -663,4 +662,4 @@
663 662 
  /// solutions are multiplied by
664 
  /// \ref MaxWeightedMatching::primalScale "2" and
665 
  /// \ref MaxWeightedMatching::dualScale "4" respectively.
663 
  /// \ref MaxWeightedFractionalMatching::primalScale "2" and
664 
  /// \ref MaxWeightedFractionalMatching::dualScale "4" respectively.
666 665 
  ///
... ... 
@@ -1272,3 +1271,3 @@
1272 1271 
    ///
1273 
    /// This method runs the \c %MaxWeightedMatching algorithm.
1272 
    /// This method runs the \c %MaxWeightedFractionalMatching algorithm.
1274 1273 
    ///
... ... 
@@ -1402,5 +1401,4 @@
1402 1401 
  /// This class provides an efficient implementation of fractional
1403 
  /// matching algorithm. The implementation is based on extensive use
1404 
  /// of priority queues and provides \f$O(nm\log n)\f$ time
1405 
  /// complexity.
1402 
  /// matching algorithm. The implementation uses priority queues and
1403 
  /// provides \f$O(nm\log n)\f$ time complexity.
1406 1404 
  ///
... ... 
@@ -1422,3 +1420,3 @@
1422 1420 
  /// \f[ y_u + y_v \ge w_{uv} \quad \forall uv\in E\f]
1423 
  /// \f[\min \sum_{u \in V}y_u \f] ///
1421 
  /// \f[\min \sum_{u \in V}y_u \f]
1424 1422 
  ///
... ... 
@@ -1430,4 +1428,4 @@
1430 1428 
  /// solutions are multiplied by
1431 
  /// \ref MaxWeightedMatching::primalScale "2" and
1432 
  /// \ref MaxWeightedMatching::dualScale "4" respectively.
1429 
  /// \ref MaxWeightedPerfectFractionalMatching::primalScale "2" and
1430 
  /// \ref MaxWeightedPerfectFractionalMatching::dualScale "4" respectively.
1433 1431 
  ///
... ... 
@@ -2007,3 +2005,4 @@
2007 2005 
    ///
2008 
    /// This method runs the \c %MaxWeightedMatching algorithm.
2006 
    /// This method runs the \c %MaxWeightedPerfectFractionalMatching
2007 
    /// algorithm.
2009 2008 
    ///
0 comments (0 inline)