MinHeap.h File Reference

Declares & Implements Binary Heap, and Top10Heap. More...

#include <ogdf/basic/Array.h>
#include <ogdf/basic/comparer.h>

Go to the source code of this file.

Classes
class	ogdf::BinaryHeapSimple< X, INDEX >
	Dynamically growing binary heap tuned for efficiency on a small interface (compared to BinaryHeap). More...
class	ogdf::DeletingTop10Heap< X, Priority, STATICCOMPARER, INDEX >
	A variant of Top10Heap which deletes the elements that get rejected from the heap. More...
class	ogdf::Top10Heap< X, INDEX >
	A variant of BinaryHeapSimple which always holds only the 10 elements with the highest keys. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declares & Implements Binary Heap, and Top10Heap.

Author

Markus Chimani

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 MinHeap.h.