Containers

This module contains general container data structures and data types. More...

Classes
class	ogdf::Array< E, INDEX >
	The parameterized class Array implements dynamic arrays of type E. More...
class	ogdf::Array2D< E >
	The parameterized class Array2D implements dynamic two-dimensional arrays. More...
class	ogdf::ArrayBuffer< E, INDEX >
	An array that keeps track of the number of inserted elements; also usable as an efficient stack. More...
class	ogdf::BinomialHeap< T, C >
	Binomial heap implementation. More...
class	ogdf::BoundedQueue< E, INDEX >
	The parameterized class BoundedQueue implements queues with bounded size. More...
class	ogdf::FibonacciHeap< T, C >
	Fibonacci heap implementation. More...
class	ogdf::HashArray< I, E, H >
	Indexed arrays using hashing for element access. More...
class	ogdf::HashArray2D< I1, I2, E, H1, H2 >
	Indexed 2-dimensional arrays using hashing for element access. More...
class	ogdf::Hashing< K, I, H >
	Hashing with chaining and table doubling. More...
class	ogdf::HotQueue< V, P, H >
	Heap-on-Top queue implementation. More...
class	ogdf::List< E >
	Doubly linked lists (maintaining the length of the list). More...
class	ogdf::ListPure< E >
	Doubly linked lists. More...
class	ogdf::PairingHeap< T, C >
	Pairing heap implementation. More...
class	ogdf::PrioritizedMapQueue< E, P, C, Impl, HashFunc >
	Prioritized queue interface wrapper for heaps. More...
class	ogdf::PriorityQueue< T, C, Impl >
	Priority queue interface wrapper for heaps. More...
class	ogdf::Queue< E >
	The parameterized class Queue<E> implements list-based queues. More...
class	ogdf::QueuePure< E >
	Implementation of list-based queues. More...
class	ogdf::RadixHeap< V, P >
	Radix heap data structure implementation. More...
class	ogdf::RMHeap< T, C >
	Randomized meldable heap implementation. More...
class	ogdf::SList< E >
	Singly linked lists (maintaining the length of the list). More...
class	ogdf::SListPure< E >
	Singly linked lists. More...
class	ogdf::SortedSequence< KEY, INFO, CMP >
	Maintains a sequence of (key,info) pairs sorted by key. More...

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.

Detailed Description

This module contains general container data structures and data types.

Typedef Documentation

PrioritizedQueue

template<typename E , typename P , class C = std::less<P>, template< typename, class > class Impl = PairingHeap>

using ogdf::PrioritizedQueue = typedef pq_internal::PrioritizedQueue<E, P, C, Impl>

Prioritized queue interface wrapper for heaps.

Extends the default priority queue interface by adding the functionality to store elements with assigned priorities. The stored elements do not have to be unique.

Template Parameters

E	Denotes value type of inserted elements.
P	Denotes the type of priority.
C	Denotes the comparison functor for comparing priorities.
Impl	Denotes the underlying heap class.

Definition at line 382 of file PriorityQueue.h.