HotQueue.h File Reference

Implementation of Heap-on-Top data structure. More...

#include <algorithm>
#include <cmath>
#include <cstddef>
#include <iterator>
#include <limits>
#include <utility>
#include <vector>

Go to the source code of this file.

Classes
class	ogdf::HotQueue< V, P, H >
	Heap-on-Top queue implementation. More...
struct	ogdf::HotQueue< V, P, H >::HeapComparator
	Comparator used by underlying heap. More...
struct	ogdf::HotQueueHandle< V, P, HeapHandle >
	Heap-on-Top handle to inserted items. More...
struct	ogdf::HotQueueNode< V, P >
	Heap-on-Top bucket element. More...

Namespaces
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Implementation of Heap-on-Top data structure.

Author

Łukasz Hanuszczak

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file HotQueue.h.