equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #ifndef LEMON_BUCKET_HEAP_H |
19 #ifndef LEMON_BUCKET_HEAP_H |
20 #define LEMON_BUCKET_HEAP_H |
20 #define LEMON_BUCKET_HEAP_H |
21 |
21 |
22 ///\ingroup auxdat |
22 ///\ingroup heaps |
23 ///\file |
23 ///\file |
24 ///\brief Bucket heap implementation. |
24 ///\brief Bucket heap implementation. |
25 |
25 |
26 #include <vector> |
26 #include <vector> |
27 #include <utility> |
27 #include <utility> |
51 } |
51 } |
52 }; |
52 }; |
53 |
53 |
54 } |
54 } |
55 |
55 |
56 /// \ingroup auxdat |
56 /// \ingroup heaps |
57 /// |
57 /// |
58 /// \brief Bucket heap data structure. |
58 /// \brief Bucket heap data structure. |
59 /// |
59 /// |
60 /// This class implements the \e bucket \e heap data structure. |
60 /// This class implements the \e bucket \e heap data structure. |
61 /// It practically conforms to the \ref concepts::Heap "heap concept", |
61 /// It practically conforms to the \ref concepts::Heap "heap concept", |
369 std::vector<BucketItem> _data; |
369 std::vector<BucketItem> _data; |
370 mutable int _minimum; |
370 mutable int _minimum; |
371 |
371 |
372 }; // class BucketHeap |
372 }; // class BucketHeap |
373 |
373 |
374 /// \ingroup auxdat |
374 /// \ingroup heaps |
375 /// |
375 /// |
376 /// \brief Simplified bucket heap data structure. |
376 /// \brief Simplified bucket heap data structure. |
377 /// |
377 /// |
378 /// This class implements a simplified \e bucket \e heap data |
378 /// This class implements a simplified \e bucket \e heap data |
379 /// structure. It does not provide some functionality, but it is |
379 /// structure. It does not provide some functionality, but it is |