1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
|
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Data Structures</title>
<link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
<link rel="home" href="../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="../heap.html" title="Chapter 11. Boost.Heap">
<link rel="prev" href="concepts.html" title="Concepts & Interface">
<link rel="next" href="reference.html" title="Reference">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td>
<td align="center"><a href="../../../index.html">Home</a></td>
<td align="center"><a href="../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
<td align="center"><a href="../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="concepts.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="heap.data_structures"></a><a class="link" href="data_structures.html" title="Data Structures">Data Structures</a>
</h2></div></div></div>
<div class="toc"><dl><dt><span class="section"><a href="data_structures.html#heap.data_structures.data_structure_configuration">Data
Structure Configuration</a></span></dt></dl></div>
<p>
<code class="literal">boost.heap</code> provides the following data structures:
</p>
<div class="variablelist">
<p class="title"><b></b></p>
<dl>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/priority_queue.html" title="Class template priority_queue">boost::heap::priority_queue</a></code></span></dt>
<dd><p>
The <code class="computeroutput"><a class="link" href="../boost/heap/priority_queue.html" title="Class template priority_queue">priority_queue</a></code>
class is a wrapper to the stl heap functions. It implements a heap as
container adaptor ontop of a <code class="literal">std::vector</code> and is immutable.
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/d_ary_heap.html" title="Class template d_ary_heap">boost::heap::d_ary_heap</a></code></span></dt>
<dd>
<p>
<a href="http://en.wikipedia.org/wiki/D-ary_heap" target="_top">D-ary heaps</a>
are a generalization of binary heap with each non-leaf node having N
children. For a low arity, the height of the heap is larger, but the
number of comparisons to find the largest child node is bigger. D-ary
heaps are implemented as container adaptors based on a <code class="literal">std::vector</code>.
</p>
<p>
The data structure can be configured as mutable. This is achieved by
storing the values inside a std::list.
</p>
</dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/binomial_heap.html" title="Class template binomial_heap">boost::heap::binomial_heap</a></code></span></dt>
<dd><p>
<a href="http://en.wikipedia.org/wiki/Binomial_heap" target="_top">Binomial heaps</a>
are node-base heaps, that are implemented as a set of binomial trees
of piecewise different order. The most important heap operations have
a worst-case complexity of O(log n). In contrast to d-ary heaps, binomial
heaps can also be merged in O(log n).
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/fibonacci_heap.html" title="Class template fibonacci_heap">boost::heap::fibonacci_heap</a></code></span></dt>
<dd><p>
<a href="http://en.wikipedia.org/wiki/Fibonacci_heap" target="_top">Fibonacci heaps</a>
are node-base heaps, that are implemented as a forest of heap-ordered
trees. They provide better amortized performance than binomial heaps.
Except <code class="literal">pop()</code> and <code class="literal">erase()</code>, the most
important heap operations have constant amortized complexity.
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/pairing_heap.html" title="Class template pairing_heap">boost::heap::pairing_heap</a></code></span></dt>
<dd>
<p>
<a href="http://en.wikipedia.org/wiki/Pairing_heap" target="_top">Pairing heaps</a>
are self-adjusting node-based heaps. Although design and implementation
are rather simple, the complexity analysis is yet unsolved. For details,
consult:
</p>
<p>
Pettie, Seth (2005), "Towards a final analysis of pairing heaps",
Proc. 46th Annual IEEE Symposium on Foundations of Computer Science,
pp. 174–183
</p>
</dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/skew_heap.html" title="Class template skew_heap">boost::heap::skew_heap</a></code></span></dt>
<dd><p>
<a href="http://en.wikipedia.org/wiki/Skew_heap" target="_top">Skew heaps</a>
are self-adjusting node-based heaps. Although there are no constraints
for the tree structure, all heap operations can be performed in O(log
n).
</p></dd>
</dl>
</div>
<div class="table">
<a name="heap.data_structures.t0"></a><p class="title"><b>Table 11.1. Comparison of amortized complexity</b></p>
<div class="table-contents"><table class="table" summary="Comparison of amortized complexity">
<colgroup>
<col>
<col>
<col>
<col>
<col>
<col>
<col>
<col>
<col>
</colgroup>
<thead><tr>
<th>
</th>
<th>
<p>
<code class="literal">top()</code>
</p>
</th>
<th>
<p>
<code class="literal">push()</code>
</p>
</th>
<th>
<p>
<code class="literal">pop()</code>
</p>
</th>
<th>
<p>
<code class="literal">update()</code>
</p>
</th>
<th>
<p>
<code class="literal">increase()</code>
</p>
</th>
<th>
<p>
<code class="literal">decrease()</code>
</p>
</th>
<th>
<p>
<code class="literal">erase()</code>
</p>
</th>
<th>
<p>
<code class="literal">merge_and_clear()</code>
</p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/priority_queue.html" title="Class template priority_queue">boost::heap::priority_queue</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
n/a
</p>
</td>
<td>
<p>
n/a
</p>
</td>
<td>
<p>
n/a
</p>
</td>
<td>
<p>
n/a
</p>
</td>
<td>
<p>
O((N+M)*log(N+M))
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/d_ary_heap.html" title="Class template d_ary_heap">boost::heap::d_ary_heap</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O((N+M)*log(N+M))
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/binomial_heap.html" title="Class template binomial_heap">boost::heap::binomial_heap</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N+M))
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/fibonacci_heap.html" title="Class template fibonacci_heap">boost::heap::fibonacci_heap</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(1)
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N)) <sup>[<a name="heap.data_structures.f0" href="#ftn.heap.data_structures.f0" class="footnote">a</a>]</sup>
</p>
</td>
<td>
<p>
O(1)
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(1)
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/pairing_heap.html" title="Class template pairing_heap">boost::heap::pairing_heap</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
<td>
<p>
O(2**2*log(log(N)))
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><a class="link" href="../boost/heap/skew_heap.html" title="Class template skew_heap">boost::heap::skew_heap</a></code>
</p>
</td>
<td>
<p>
<code class="literal">O(1)</code>
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N))
</p>
</td>
<td>
<p>
O(log(N+M))
</p>
</td>
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="9"><div class="footnote"><p><sup>[<a id="ftn.heap.data_structures.f0" href="#heap.data_structures.f0" class="para">a</a>] </sup>
The fibonacci a <code class="literal">update_lazy()</code> method, which
has O(log(N)) amortized complexity as well, but does not try to
consolidate the internal forest
</p></div></td></tr></tbody>
</table></div>
</div>
<br class="table-break"><div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="heap.data_structures.data_structure_configuration"></a><a class="link" href="data_structures.html#heap.data_structures.data_structure_configuration" title="Data Structure Configuration">Data
Structure Configuration</a>
</h3></div></div></div>
<p>
The data structures can be configured with <a href="../../../libs/parameter/doc/html/index.html" target="_top">Boost.Parameter</a>-style
templates.
</p>
<div class="variablelist">
<p class="title"><b></b></p>
<dl>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/compare.html" title="Struct template compare">boost::heap::compare</a></code></span></dt>
<dd><p>
Predicate for defining the heap order, optional (defaults to <code class="literal">boost::heap::compare<std::less<T>
></code>)
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/allocator.html" title="Struct template allocator">boost::heap::allocator</a></code></span></dt>
<dd><p>
Allocator for internal memory management, optional (defaults to <code class="literal">boost::heap::allocator<std::allocator<T>
></code>)
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/stable.html" title="Struct template stable">boost::heap::stable</a></code></span></dt>
<dd><p>
Configures the heap to use a <a class="link" href="concepts.html#heap.concepts.stability" title="Stability">stable
heap order</a>, optional (defaults to <code class="literal">boost::heap::stable<false></code>).
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/mutable_.html" title="Struct template mutable_">boost::heap::mutable_</a></code></span></dt>
<dd><p>
Configures the heap to be mutable. <code class="computeroutput"><a class="link" href="../boost/heap/d_ary_heap.html" title="Class template d_ary_heap">boost::heap::d_ary_heap</a></code>
and <code class="computeroutput"><a class="link" href="../boost/heap/skew_heap.html" title="Class template skew_heap">boost::heap::skew_heap</a></code>
have to be configured with this policy to enable the <a class="link" href="concepts.html#heap.concepts.mutability" title="Mutability">mutability
interface</a>.
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/stability_counter_type.html" title="Struct template stability_counter_type">boost::heap::stability_counter_type</a></code></span></dt>
<dd><p>
Configures the integer type used for the stability counter, optional
(defaults to <code class="literal">boost::heap::stability_counter_type<boost::uintmax_t></code>).
For more details, consult the <a class="link" href="concepts.html#heap.concepts.stability" title="Stability">Stability</a>
section.
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/constant_time_size.html" title="Struct template constant_time_size">boost::heap::constant_time_size</a></code></span></dt>
<dd><p>
Specifies, whether <code class="literal">size()</code> should have linear or
constant complexity. This argument is only available for node-based
heap data structures and if available, it is optional (defaults to
<code class="literal">boost::heap::constant_time_size<true></code>)
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/arity.html" title="Struct template arity">boost::heap::arity</a></code></span></dt>
<dd><p>
Specifies the arity of a d-ary heap. For details, please consult the
class reference of <code class="computeroutput"><a class="link" href="../boost/heap/d_ary_heap.html" title="Class template d_ary_heap">boost::heap::d_ary_heap</a></code>
</p></dd>
<dt><span class="term"><code class="computeroutput"><a class="link" href="../boost/heap/store_parent_pointer.html" title="Struct template store_parent_pointer">boost::heap::store_parent_pointer</a></code></span></dt>
<dd><p>
Store the parent pointer in the heap nodes. This policy is only available
in the <code class="computeroutput"><a class="link" href="../boost/heap/skew_heap.html" title="Class template skew_heap">boost::heap::skew_heap</a></code>.
</p></dd>
</dl>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2010, 2011 Tim Blechmann<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="concepts.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
|
