equal
deleted
inserted
replaced
35 /// |
35 /// |
36 /// This class implements the \e bucket \e heap data structure. A \e heap |
36 /// This class implements the \e bucket \e heap data structure. A \e heap |
37 /// is a data structure for storing items with specified values called \e |
37 /// is a data structure for storing items with specified values called \e |
38 /// priorities in such a way that finding the item with minimum priority is |
38 /// priorities in such a way that finding the item with minimum priority is |
39 /// efficient. The bucket heap is very simple implementation, it can store |
39 /// efficient. The bucket heap is very simple implementation, it can store |
40 /// only integer priorities and it stores for each priority in the [0..C] |
40 /// only integer priorities and it stores for each priority in the |
41 /// range a list of items. So it should be used only when the priorities |
41 /// \f$ [0..C) \f$ range a list of items. So it should be used only when |
42 /// are small. It is not intended to use as dijkstra heap. |
42 /// the priorities are small. It is not intended to use as dijkstra heap. |
43 /// |
43 /// |
44 /// \param _Item Type of the items to be stored. |
44 /// \param _Item Type of the items to be stored. |
45 /// \param _ItemIntMap A read and writable Item int map, used internally |
45 /// \param _ItemIntMap A read and writable Item int map, used internally |
46 /// to handle the cross references. |
46 /// to handle the cross references. |
47 /// \param minimize If the given parameter is true then the heap gives back |
47 /// \param minimize If the given parameter is true then the heap gives back |