Copyright © 2010, 2011 Tim Blechmann
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Table of Contents
boost.heap is an implementation of priority queues. Priority
queues are queue data structures, that order their elements by a priority.
The STL provides a single template class
which only provides a limited functionality. To overcome these limitations,
boost.heap implements data
structures with more functionality and different performance characteristics.
Especially, it deals with additional aspects:
Last revised: June 25, 2013 at 22:23:51 GMT