IndexMinPriorityQueueT Class

The IndexMinPriorityQueue class represents an indexed priority queue of generic keys.

Inheritance Hierarchy

SystemObject
RogueSharp.AlgorithmsIndexMinPriorityQueueT

Namespace: RogueSharp.Algorithms
Assembly:

public class IndexMinPriorityQueue<T>
where T : Object, IComparable<T>

Type must implement IComparable interface

The IndexMinPriorityQueueT type exposes the following members.

Name	Description
IndexMinPriorityQueueT	Constructs an empty indexed priority queue with indices between 0 and the specified maxSize - 1

Name	Description
Size	The number of keys on this indexed priority queue

Name	Description
ChangeKey	Change the key associated with the specified index to the specified value
Contains	Is the specified parameter i an index on the priority queue?
DecreaseKey	Decrease the key associated with the specified index to the specified value
Delete	Remove the key associated with the specified index
DeleteMin	Removes a minimum key and returns its associated index
Equals	Determines whether the specified Object is equal to the current Object. (Inherited from Object.)
Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)
GetHashCode	Serves as a hash function for a particular type. (Inherited from Object.)
GetType	Gets the Type of the current instance. (Inherited from Object.)
IncreaseKey	Increase the key associated with the specified index to the specified value
Insert	Associates the specified key with the specified index
IsEmpty	Is the indexed priority queue empty?
KeyAt	Returns the key associated with the specified index
MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object.)
MinIndex	Returns an index associated with a minimum key
MinKey	Returns a minimum key
ToString	Returns a string that represents the current object. (Inherited from Object.)