PriorityQueue.h File Reference

Priority queue interface wrapping various heaps. More...

#include <ogdf/basic/EdgeArray.h>
#include <ogdf/basic/HashArray.h>
#include <ogdf/basic/NodeArray.h>
#include <ogdf/basic/heap/PairingHeap.h>
#include <functional>
#include <utility>

Go to the source code of this file.

Classes
class	ogdf::pq_internal::Compare< T, C >
	Used to compare elements with assigned priorities. More...
class	ogdf::pq_internal::PairTemplate< E, P >
	Pair for storing an element and a priority. More...
class	ogdf::pq_internal::PrioritizedArrayQueueBase< E, P, C, Impl, Map >
class	ogdf::pq_internal::PrioritizedQueue< E, P, C, Impl >
	Defines a queue for handling prioritized elements. More...
class	ogdf::PrioritizedMapQueue< E, P, C, Impl, HashFunc >
	Prioritized queue interface wrapper for heaps. More...
class	ogdf::PrioritizedMapQueue< edge, P, C, Impl, HashFunc >
	Specialization for edge elements. More...
class	ogdf::PrioritizedMapQueue< node, P, C, Impl, HashFunc >
	Specialization for node elements. More...
class	ogdf::PriorityQueue< T, C, Impl >
	Priority queue interface wrapper for heaps. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
namespace	ogdf::pq_internal
	This namespace contains helper classes to keep the code dry.

Typedefs
template<typename E , typename P , class C = std::less<P>, template< typename, class > class Impl = PairingHeap>
using	ogdf::PrioritizedQueue = pq_internal::PrioritizedQueue< E, P, C, Impl >
	Prioritized queue interface wrapper for heaps.
template<typename E , typename P , class C , template< typename, class > class Impl>
using	ogdf::pq_internal::SuperQueueTemplate = PriorityQueue< PairTemplate< E, P >, Compare< PairTemplate< E, P >, C >, Impl >
	Shortcut for the base class of ::PrioritizedQueue.

Detailed Description

Priority queue interface wrapping various heaps.

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