equal
deleted
inserted
replaced
86 PRE_HEAP = -1, |
86 PRE_HEAP = -1, |
87 ///The node was in the heap but it got out of it |
87 ///The node was in the heap but it got out of it |
88 POST_HEAP = -2 |
88 POST_HEAP = -2 |
89 }; |
89 }; |
90 |
90 |
|
91 ///The constructor |
|
92 |
|
93 /** |
|
94 \c _iimap should be given to the constructor, since it is |
|
95 used internally to handle the cross references. |
|
96 */ |
91 explicit FibHeap(ItemIntMap &_iimap) |
97 explicit FibHeap(ItemIntMap &_iimap) |
92 : minimum(0), iimap(_iimap), num_items() {} |
98 : minimum(0), iimap(_iimap), num_items() {} |
|
99 |
|
100 ///The constructor |
|
101 |
|
102 /** |
|
103 \c _iimap should be given to the constructor, since it is used |
|
104 internally to handle the cross references. \c _comp is an |
|
105 object for ordering of the priorities. |
|
106 */ |
93 FibHeap(ItemIntMap &_iimap, const Compare &_comp) : minimum(0), |
107 FibHeap(ItemIntMap &_iimap, const Compare &_comp) : minimum(0), |
94 iimap(_iimap), comp(_comp), num_items() {} |
108 iimap(_iimap), comp(_comp), num_items() {} |
95 |
109 |
96 ///The number of items stored in the heap. |
110 ///The number of items stored in the heap. |
97 |
111 |
98 /** |
112 /** |
99 Returns the number of items stored in the heap. |
113 Returns the number of items stored in the heap. |