Changeset 559:c5fd2d996909 in lemon1.2 for lemon/max_matching.h
 Timestamp:
 03/29/09 23:08:20 (11 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/max_matching.h
r440 r559 56 56 /// decomposition() after running the algorithm. 57 57 /// 58 /// \param _GraphThe graph type the algorithm runs on.59 template <typename _Graph>58 /// \param GR The graph type the algorithm runs on. 59 template <typename GR> 60 60 class MaxMatching { 61 61 public: 62 62 63 typedef _GraphGraph;63 typedef GR Graph; 64 64 typedef typename Graph::template NodeMap<typename Graph::Arc> 65 65 MatchingMap; … … 464 464 /// map must have the property that there are no two incident edges 465 465 /// with true value, ie. it contains a matching. 466 /// \return %True if the map contains a matching.466 /// \return \c true if the map contains a matching. 467 467 template <typename MatchingMap> 468 468 bool matchingInit(const MatchingMap& matching) { … … 614 614 /// maximum weighted matching algorithm. The implementation is based 615 615 /// on extensive use of priority queues and provides 616 /// \f$O(nm\log (n))\f$ time complexity.616 /// \f$O(nm\log n)\f$ time complexity. 617 617 /// 618 618 /// The maximum weighted matching problem is to find undirected … … 648 648 /// of a blossom. If the value type is integral then the dual 649 649 /// solution is multiplied by \ref MaxWeightedMatching::dualScale "4". 650 template <typename _Graph,651 typename _WeightMap = typename _Graph::template EdgeMap<int> >650 template <typename GR, 651 typename WM = typename GR::template EdgeMap<int> > 652 652 class MaxWeightedMatching { 653 653 public: 654 654 655 typedef _Graph Graph; 656 typedef _WeightMap WeightMap; 655 ///\e 656 typedef GR Graph; 657 ///\e 658 typedef WM WeightMap; 659 ///\e 657 660 typedef typename WeightMap::Value Value; 658 661 … … 1958 1961 /// maximum weighted perfect matching algorithm. The implementation 1959 1962 /// is based on extensive use of priority queues and provides 1960 /// \f$O(nm\log (n))\f$ time complexity.1963 /// \f$O(nm\log n)\f$ time complexity. 1961 1964 /// 1962 1965 /// The maximum weighted matching problem is to find undirected … … 1991 1994 /// of a blossom. If the value type is integral then the dual 1992 1995 /// solution is multiplied by \ref MaxWeightedMatching::dualScale "4". 1993 template <typename _Graph,1994 typename _WeightMap = typename _Graph::template EdgeMap<int> >1996 template <typename GR, 1997 typename WM = typename GR::template EdgeMap<int> > 1995 1998 class MaxWeightedPerfectMatching { 1996 1999 public: 1997 2000 1998 typedef _GraphGraph;1999 typedef _WeightMapWeightMap;2001 typedef GR Graph; 2002 typedef WM WeightMap; 2000 2003 typedef typename WeightMap::Value Value; 2001 2004
Note: See TracChangeset
for help on using the changeset viewer.