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
|
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<title>Boost Priority Queues Library</title>
</head>
<body bgcolor="#FFFFFF" text="#000000">
<table border="1" bgcolor="#007F7F" cellpadding="2">
<tr>
<td bgcolor="#FFFFFF"><img src="../../c++boost.gif" alt="c++boost.gif (8819 bytes)" WIDTH="277" HEIGHT="86"></td>
<td><a href="../../index.htm"><font face="Arial" color="#FFFFFF"><big>Home </big></font></a></td>
<td><a href="../libraries.htm"><font face="Arial" color="#FFFFFF"><big>Libraries </big></font></a></td>
<td><a href="../../people/people.htm"><font face="Arial" color="#FFFFFF"><big>People </big></font></a></td>
<td><a href="../../more/faq.htm"><font face="Arial" color="#FFFFFF"><big>FAQ </big></font></a></td>
<td><a href="../../more/index.htm"><font face="Arial" color="#FFFFFF"><big>More </big></font></a></td>
</tr>
</table>
<h1>Priority Queues Library</h1>
<p>
The header heap.hpp provides a set of different priority queue implementations.
The interface of all classes is an extended version of the priority queue
supported by the standard library: The priority queues are extended to support
modification of arbitrary elements and to provide access to all elements
currently stored in the priority queue. The priority queues implemented include
a d-heap, a Fibonacci heap, a pairing heap, and a splay heap. Also included
are implementations of a stack and queue which share the same interface as
the other priority classes.
<ul>
<li><a href="heap.html">Documentation</a> (HTML).</li>
<li>A <a href="heap-sample.html">sample program</a>.</li>
<li>Download a single <a href="boost-heap-1.0.zip">ZIP</a> file containing all the
priority queues library files.</li>
<li>Submitted by <a href="../../people/dietmar_kuehl.htm">Dietmar Khl</a>.</li>
</ul>
<p>Revised July 17, 1999 </p>
<p> </p>
</body>
</html>
|
