Changes in lemon/bin_heap.h [758:28cfac049a6a:730:9f529abcaebf] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bin_heap.h
r758 r730 20 20 #define LEMON_BIN_HEAP_H 21 21 22 ///\ingroup heaps22 ///\ingroup auxdat 23 23 ///\file 24 ///\brief Binary heap implementation.24 ///\brief Binary Heap implementation. 25 25 26 26 #include <vector> … … 30 30 namespace lemon { 31 31 32 /// \ingroup heaps 33 /// 34 /// \brief Binary heap data structure. 35 /// 36 /// This class implements the \e binary \e heap data structure. 37 /// It fully conforms to the \ref concepts::Heap "heap concept". 38 /// 39 /// \tparam PR Type of the priorities of the items. 40 /// \tparam IM A read-writable item map with \c int values, used 41 /// internally to handle the cross references. 42 /// \tparam CMP A functor class for comparing the priorities. 43 /// The default is \c std::less<PR>. 44 #ifdef DOXYGEN 45 template <typename PR, typename IM, typename CMP> 46 #else 32 ///\ingroup auxdat 33 /// 34 ///\brief A Binary Heap implementation. 35 /// 36 ///This class implements the \e binary \e heap data structure. 37 /// 38 ///A \e heap is a data structure for storing items with specified values 39 ///called \e priorities in such a way that finding the item with minimum 40 ///priority is efficient. \c CMP specifies the ordering of the priorities. 41 ///In a heap one can change the priority of an item, add or erase an 42 ///item, etc. 43 /// 44 ///\tparam PR Type of the priority of the items. 45 ///\tparam IM A read and writable item map with int values, used internally 46 ///to handle the cross references. 47 ///\tparam CMP A functor class for the ordering of the priorities. 48 ///The default is \c std::less<PR>. 49 /// 50 ///\sa FibHeap 51 ///\sa Dijkstra 47 52 template <typename PR, typename IM, typename CMP = std::less<PR> > 48 #endif49 53 class BinHeap { 54 50 55 public: 51 52 /// Type of the item-int map. 56 ///\e 53 57 typedef IM ItemIntMap; 54 /// Type of the priorities.58 ///\e 55 59 typedef PR Prio; 56 /// Type of the items stored in the heap.60 ///\e 57 61 typedef typename ItemIntMap::Key Item; 58 /// Type of the item-priority pairs.62 ///\e 59 63 typedef std::pair<Item,Prio> Pair; 60 /// Functor type for comparing the priorities.64 ///\e 61 65 typedef CMP Compare; 62 66 63 /// \brief Type to represent the states of the items.64 /// 65 /// Each item has a state associated to it. It canbe "in heap",66 /// "pre -heap" or "post-heap". The latter two are indifferent from the67 /// \brief Type to represent the items states. 68 /// 69 /// Each Item element have a state associated to it. It may be "in heap", 70 /// "pre heap" or "post heap". The latter two are indifferent from the 67 71 /// heap's point of view, but may be useful to the user. 68 72 /// … … 81 85 82 86 public: 83 84 /// \brief Constructor. 85 /// 86 /// Constructor. 87 /// \param map A map that assigns \c int values to the items. 88 /// It is used internally to handle the cross references. 89 /// The assigned value must be \c PRE_HEAP (<tt>-1</tt>) for each item. 87 /// \brief The constructor. 88 /// 89 /// The constructor. 90 /// \param map should be given to the constructor, since it is used 91 /// internally to handle the cross references. The value of the map 92 /// must be \c PRE_HEAP (<tt>-1</tt>) for every item. 90 93 explicit BinHeap(ItemIntMap &map) : _iim(map) {} 91 94 92 /// \brief Constructor. 93 /// 94 /// Constructor. 95 /// \param map A map that assigns \c int values to the items. 96 /// It is used internally to handle the cross references. 97 /// The assigned value must be \c PRE_HEAP (<tt>-1</tt>) for each item. 98 /// \param comp The function object used for comparing the priorities. 95 /// \brief The constructor. 96 /// 97 /// The constructor. 98 /// \param map should be given to the constructor, since it is used 99 /// internally to handle the cross references. The value of the map 100 /// should be PRE_HEAP (-1) for each element. 101 /// 102 /// \param comp The comparator function object. 99 103 BinHeap(ItemIntMap &map, const Compare &comp) 100 104 : _iim(map), _comp(comp) {} 101 105 102 106 103 /// \briefThe number of items stored in the heap.104 /// 105 /// This function returns the number of items stored in the heap.107 /// The number of items stored in the heap. 108 /// 109 /// \brief Returns the number of items stored in the heap. 106 110 int size() const { return _data.size(); } 107 111 108 /// \brief Check if the heap is empty.109 /// 110 /// This function returns \c true if the heap is empty.112 /// \brief Checks if the heap stores no items. 113 /// 114 /// Returns \c true if and only if the heap stores no items. 111 115 bool empty() const { return _data.empty(); } 112 116 113 /// \brief Make the heap empty. 114 /// 115 /// This functon makes the heap empty. 116 /// It does not change the cross reference map. If you want to reuse 117 /// a heap that is not surely empty, you should first clear it and 118 /// then you should set the cross reference map to \c PRE_HEAP 119 /// for each item. 117 /// \brief Make empty this heap. 118 /// 119 /// Make empty this heap. It does not change the cross reference map. 120 /// If you want to reuse what is not surely empty you should first clear 121 /// the heap and after that you should set the cross reference map for 122 /// each item to \c PRE_HEAP. 120 123 void clear() { 121 124 _data.clear(); … … 125 128 static int parent(int i) { return (i-1)/2; } 126 129 127 static int second Child(int i) { return 2*i+2; }130 static int second_child(int i) { return 2*i+2; } 128 131 bool less(const Pair &p1, const Pair &p2) const { 129 132 return _comp(p1.second, p2.second); 130 133 } 131 134 132 int bubble Up(int hole, Pair p) {135 int bubble_up(int hole, Pair p) { 133 136 int par = parent(hole); 134 137 while( hole>0 && less(p,_data[par]) ) { … … 141 144 } 142 145 143 int bubble Down(int hole, Pair p, int length) {144 int child = second Child(hole);146 int bubble_down(int hole, Pair p, int length) { 147 int child = second_child(hole); 145 148 while(child < length) { 146 149 if( less(_data[child-1], _data[child]) ) { … … 151 154 move(_data[child], hole); 152 155 hole = child; 153 child = second Child(hole);156 child = second_child(hole); 154 157 } 155 158 child--; … … 169 172 170 173 public: 171 172 174 /// \brief Insert a pair of item and priority into the heap. 173 175 /// 174 /// This function inserts \c p.first to the heap with priority 175 /// \c p.second. 176 /// Adds \c p.first to the heap with priority \c p.second. 176 177 /// \param p The pair to insert. 177 /// \pre \c p.first must not be stored in the heap.178 178 void push(const Pair &p) { 179 179 int n = _data.size(); 180 180 _data.resize(n+1); 181 bubbleUp(n, p); 182 } 183 184 /// \brief Insert an item into the heap with the given priority. 185 /// 186 /// This function inserts the given item into the heap with the 187 /// given priority. 181 bubble_up(n, p); 182 } 183 184 /// \brief Insert an item into the heap with the given heap. 185 /// 186 /// Adds \c i to the heap with priority \c p. 188 187 /// \param i The item to insert. 189 188 /// \param p The priority of the item. 190 /// \pre \e i must not be stored in the heap.191 189 void push(const Item &i, const Prio &p) { push(Pair(i,p)); } 192 190 193 /// \brief Return the item having minimum priority. 194 /// 195 /// This function returns the item having minimum priority. 196 /// \pre The heap must be non-empty. 191 /// \brief Returns the item with minimum priority relative to \c Compare. 192 /// 193 /// This method returns the item with minimum priority relative to \c 194 /// Compare. 195 /// \pre The heap must be nonempty. 197 196 Item top() const { 198 197 return _data[0].first; 199 198 } 200 199 201 /// \brief The minimum priority.202 /// 203 /// This function returns the minimum priority.204 /// \pre The heap must be non -empty.200 /// \brief Returns the minimum priority relative to \c Compare. 201 /// 202 /// It returns the minimum priority relative to \c Compare. 203 /// \pre The heap must be nonempty. 205 204 Prio prio() const { 206 205 return _data[0].second; 207 206 } 208 207 209 /// \brief Remove the item having minimum priority. 210 /// 211 /// This function removes the item having minimum priority. 208 /// \brief Deletes the item with minimum priority relative to \c Compare. 209 /// 210 /// This method deletes the item with minimum priority relative to \c 211 /// Compare from the heap. 212 212 /// \pre The heap must be non-empty. 213 213 void pop() { … … 215 215 _iim.set(_data[0].first, POST_HEAP); 216 216 if (n > 0) { 217 bubble Down(0, _data[n], n);217 bubble_down(0, _data[n], n); 218 218 } 219 219 _data.pop_back(); 220 220 } 221 221 222 /// \brief Remove the given item from the heap. 223 /// 224 /// This function removes the given item from the heap if it is 225 /// already stored. 226 /// \param i The item to delete. 227 /// \pre \e i must be in the heap. 222 /// \brief Deletes \c i from the heap. 223 /// 224 /// This method deletes item \c i from the heap. 225 /// \param i The item to erase. 226 /// \pre The item should be in the heap. 228 227 void erase(const Item &i) { 229 228 int h = _iim[i]; … … 231 230 _iim.set(_data[h].first, POST_HEAP); 232 231 if( h < n ) { 233 if ( bubble Up(h, _data[n]) == h) {234 bubble Down(h, _data[n], n);232 if ( bubble_up(h, _data[n]) == h) { 233 bubble_down(h, _data[n], n); 235 234 } 236 235 } … … 238 237 } 239 238 240 /// \brief The priority of the given item. 241 /// 242 /// This function returns the priority of the given item. 243 /// \param i The item. 244 /// \pre \e i must be in the heap. 239 240 /// \brief Returns the priority of \c i. 241 /// 242 /// This function returns the priority of item \c i. 243 /// \param i The item. 244 /// \pre \c i must be in the heap. 245 245 Prio operator[](const Item &i) const { 246 246 int idx = _iim[i]; … … 248 248 } 249 249 250 /// \brief Set the priority of an item or insert it, if it is 251 /// not stored in the heap. 252 /// 253 /// This method sets the priority of the given item if it is 254 /// already stored in the heap. Otherwise it inserts the given 255 /// item into the heap with the given priority. 250 /// \brief \c i gets to the heap with priority \c p independently 251 /// if \c i was already there. 252 /// 253 /// This method calls \ref push(\c i, \c p) if \c i is not stored 254 /// in the heap and sets the priority of \c i to \c p otherwise. 256 255 /// \param i The item. 257 256 /// \param p The priority. … … 262 261 } 263 262 else if( _comp(p, _data[idx].second) ) { 264 bubble Up(idx, Pair(i,p));263 bubble_up(idx, Pair(i,p)); 265 264 } 266 265 else { 267 bubble Down(idx, Pair(i,p), _data.size());268 } 269 } 270 271 /// \brief Decrease the priority of an item to the given value.272 /// 273 /// This function decreases the priority of an item to the given value.266 bubble_down(idx, Pair(i,p), _data.size()); 267 } 268 } 269 270 /// \brief Decreases the priority of \c i to \c p. 271 /// 272 /// This method decreases the priority of item \c i to \c p. 274 273 /// \param i The item. 275 274 /// \param p The priority. 276 /// \pre \e i must be stored in the heap with priority at least \e p. 275 /// \pre \c i must be stored in the heap with priority at least \c 276 /// p relative to \c Compare. 277 277 void decrease(const Item &i, const Prio &p) { 278 278 int idx = _iim[i]; 279 bubble Up(idx, Pair(i,p));280 } 281 282 /// \brief Increase the priority of an item to the given value.283 /// 284 /// This function increases the priority of an item to the given value.279 bubble_up(idx, Pair(i,p)); 280 } 281 282 /// \brief Increases the priority of \c i to \c p. 283 /// 284 /// This method sets the priority of item \c i to \c p. 285 285 /// \param i The item. 286 286 /// \param p The priority. 287 /// \pre \e i must be stored in the heap with priority at most \e p. 287 /// \pre \c i must be stored in the heap with priority at most \c 288 /// p relative to \c Compare. 288 289 void increase(const Item &i, const Prio &p) { 289 290 int idx = _iim[i]; 290 bubble Down(idx, Pair(i,p), _data.size());291 } 292 293 /// \brief Return the state of an item.294 /// 295 /// This method returns \c PRE_HEAP if the given item has never296 /// been in the heap, \c IN_HEAP if it is in the heap at the moment,297 /// and \c POST_HEAP otherwise.298 /// In the latter case it is possible that the item will get back299 /// to the heap again.291 bubble_down(idx, Pair(i,p), _data.size()); 292 } 293 294 /// \brief Returns if \c item is in, has already been in, or has 295 /// never been in the heap. 296 /// 297 /// This method returns PRE_HEAP if \c item has never been in the 298 /// heap, IN_HEAP if it is in the heap at the moment, and POST_HEAP 299 /// otherwise. In the latter case it is possible that \c item will 300 /// get back to the heap again. 300 301 /// \param i The item. 301 302 State state(const Item &i) const { … … 306 307 } 307 308 308 /// \brief Set the state of anitem in the heap.309 /// 310 /// This function sets the state of the given item in the heap.311 /// It can be used to manually clear the heap when it is important312 /// to achivebetter time complexity.309 /// \brief Sets the state of the \c item in the heap. 310 /// 311 /// Sets the state of the \c item in the heap. It can be used to 312 /// manually clear the heap when it is important to achive the 313 /// better time complexity. 313 314 /// \param i The item. 314 315 /// \param st The state. It should not be \c IN_HEAP. … … 327 328 } 328 329 329 /// \brief Replace an item in the heap. 330 /// 331 /// This function replaces item \c i with item \c j. 332 /// Item \c i must be in the heap, while \c j must be out of the heap. 333 /// After calling this method, item \c i will be out of the 334 /// heap and \c j will be in the heap with the same prioriority 335 /// as item \c i had before. 330 /// \brief Replaces an item in the heap. 331 /// 332 /// The \c i item is replaced with \c j item. The \c i item should 333 /// be in the heap, while the \c j should be out of the heap. The 334 /// \c i item will out of the heap and \c j will be in the heap 335 /// with the same prioriority as prevoiusly the \c i item. 336 336 void replace(const Item& i, const Item& j) { 337 337 int idx = _iim[i];
Note: See TracChangeset
for help on using the changeset viewer.