Open
Graph Drawing
Framework

 v.2012.05
 

ogdf::MinPriorityQueue< Score, X > Class Template Reference

#include <ogdf/basic/MinPriorityQueue.h>

List of all members.

Public Member Functions

 MinPriorityQueue (int _size)
 ~MinPriorityQueue ()
bool empty () const
int count () const
int size () const
const X & getMin () const
void decreasePriority (const HeapElement< Score, X > *elem, Score sc)
const HeapElement< Score, X > * insert (const HeapElement< Score, X > &elem)
HeapElement< Score, X > pop ()
void outHeap ()

Private Member Functions

void swap (int pos1, int pos2)
void minHeapify (int pos)
int getParent (int pos) const
int getLeft (int pos) const
int getRight (int pos) const

Private Attributes

HeapElement< Score, X > ** heapElements
int number
int s

Detailed Description

template<class Score, class X>
class ogdf::MinPriorityQueue< Score, X >

Definition at line 84 of file MinPriorityQueue.h.


Constructor & Destructor Documentation

template<class Score , class X >
ogdf::MinPriorityQueue< Score, X >::MinPriorityQueue ( int  _size) [inline]

Definition at line 126 of file MinPriorityQueue.h.

template<class Score , class X >
ogdf::MinPriorityQueue< Score, X >::~MinPriorityQueue ( ) [inline]

Definition at line 134 of file MinPriorityQueue.h.


Member Function Documentation

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::count ( ) const [inline]

Definition at line 146 of file MinPriorityQueue.h.

template<class Score , class X >
void ogdf::MinPriorityQueue< Score, X >::decreasePriority ( const HeapElement< Score, X > *  elem,
Score  sc 
) [inline]

Definition at line 156 of file MinPriorityQueue.h.

template<class Score , class X >
bool ogdf::MinPriorityQueue< Score, X >::empty ( ) const [inline]

Definition at line 145 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::getLeft ( int  pos) const [inline, private]

Definition at line 119 of file MinPriorityQueue.h.

template<class Score , class X >
const X& ogdf::MinPriorityQueue< Score, X >::getMin ( ) const [inline]

Definition at line 150 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::getParent ( int  pos) const [inline, private]

Definition at line 118 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::getRight ( int  pos) const [inline, private]

Definition at line 120 of file MinPriorityQueue.h.

template<class Score , class X >
const HeapElement<Score, X>* ogdf::MinPriorityQueue< Score, X >::insert ( const HeapElement< Score, X > &  elem) [inline]

Definition at line 172 of file MinPriorityQueue.h.

template<class Score , class X >
void ogdf::MinPriorityQueue< Score, X >::minHeapify ( int  pos) [inline, private]

Definition at line 102 of file MinPriorityQueue.h.

template<class Score , class X >
void ogdf::MinPriorityQueue< Score, X >::outHeap ( ) [inline]

Definition at line 206 of file MinPriorityQueue.h.

template<class Score , class X >
HeapElement<Score, X> ogdf::MinPriorityQueue< Score, X >::pop ( ) [inline]

Definition at line 188 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::size ( ) const [inline]

Definition at line 147 of file MinPriorityQueue.h.

template<class Score , class X >
void ogdf::MinPriorityQueue< Score, X >::swap ( int  pos1,
int  pos2 
) [inline, private]

Definition at line 93 of file MinPriorityQueue.h.


Member Data Documentation

template<class Score , class X >
HeapElement<Score, X>** ogdf::MinPriorityQueue< Score, X >::heapElements [private]

Definition at line 88 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::number [private]

Definition at line 90 of file MinPriorityQueue.h.

template<class Score , class X >
int ogdf::MinPriorityQueue< Score, X >::s [private]

Definition at line 91 of file MinPriorityQueue.h.


The documentation for this class was generated from the following file: