Changeset 2308:cddae1c4fee6 in lemon-0.x for lemon
- Timestamp:
- 11/24/06 15:24:43 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3084
- Location:
- lemon
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/kruskal.h
r2260 r2308 119 119 120 120 NodeIntMap comp(g); 121 UnionFind<Node ,NodeIntMap> uf(comp);121 UnionFind<NodeIntMap> uf(comp); 122 122 for (typename GR::NodeIt it(g); it != INVALID; ++it) { 123 123 uf.insert(it); -
lemon/max_matching.h
r2205 r2308 67 67 68 68 typedef typename Graph::template NodeMap<int> UFECrossRef; 69 typedef UnionFindEnum< Node,UFECrossRef> UFE;69 typedef UnionFindEnum<UFECrossRef> UFE; 70 70 71 71 public: -
lemon/unionfind.h
r2205 r2308 34 34 namespace lemon { 35 35 36 //! \addtogroup auxdat 37 //! @{ 38 36 /// \ingroup auxdat 37 /// 39 38 /// \brief A \e Union-Find data structure implementation 40 39 /// … … 52 51 /// \pre You need to add all the elements by the \ref insert() 53 52 /// method. 54 template <typename Item, typenameItemIntMap>53 template <typename _ItemIntMap> 55 54 class UnionFind { 56 57 55 public: 58 typedef Item ElementType; 56 57 typedef _ItemIntMap ItemIntMap; 58 typedef typename ItemIntMap::Key Item; 59 59 60 60 private: … … 147 147 }; 148 148 149 149 /// \ingroup auxdat 150 /// 150 151 /// \brief A \e Union-Find data structure implementation which 151 152 /// is able to enumerate the components. … … 162 163 /// method. 163 164 /// 164 template <typename _Item , typename _ItemIntMap>165 template <typename _ItemIntMap> 165 166 class UnionFindEnum { 166 167 public: 167 168 168 typedef _Item Item;169 169 typedef _ItemIntMap ItemIntMap; 170 170 typedef typename ItemIntMap::Key Item; 171 171 172 private: 172 173
Note: See TracChangeset
for help on using the changeset viewer.