Object Hierarchy:

Gee.PriorityQueue Gee.PriorityQueue Gee.PriorityQueue Gee.AbstractQueue Gee.AbstractQueue Gee.AbstractQueue->Gee.PriorityQueue Gee.AbstractCollection Gee.AbstractCollection Gee.AbstractCollection->Gee.AbstractQueue GLib.Object GLib.Object GLib.Object->Gee.AbstractCollection Gee.Traversable Gee.Traversable Gee.Traversable->Gee.AbstractCollection Gee.Iterable Gee.Iterable Gee.Iterable->Gee.AbstractCollection Gee.Collection Gee.Collection Gee.Collection->Gee.AbstractCollection Gee.Queue Gee.Queue Gee.Queue->Gee.AbstractQueue


public class PriorityQueue<G> : AbstractQueue<G>

Relaxed fibonacci heap priority queue implementation of the Queue.

The elements of the priority queue are ordered according to their natural ordering, or by a compare_func provided at queue construction time. A priority queue does not permit null elements and does not have bounded capacity.

This implementation provides O(1) time for offer and peek methods, and O(log n) for poll method. It is based on the algorithms described by Boyapati Chandra Sekhar in:

"Worst Case Efficient Data Structures

for Priority Queues and Deques with Heap Order"

Boyapati Chandra Sekhar (under the guidance of Prof. C. Pandu Rangan)

Department of Computer Science and Engineering

Indian Institute of Technology, Madras

May 1996

Namespace: Gee
Package: gee-0.8



Creation methods:


Inherited Members:

All known members inherited from class Gee.AbstractQueue
All known members inherited from class Gee.AbstractCollection
All known members inherited from interface Gee.Queue
All known members inherited from interface Gee.Traversable
All known members inherited from interface Gee.Iterable