FibonacciHeap(T) Class

FibonacciHeapT Class

Very fast priority queue. Provides insertion, finding the minimum, melding and decreasing keys in constant amortized time, and deleting from an n-item heap in O(log n) amortized time.

Inheritance Hierarchy

SystemObject
Slash.Collections.PriorityQueuesFibonacciHeapT

Namespace: Slash.Collections.PriorityQueues
Assembly: Slash.Collections (in Slash.Collections.dll) Version: 1.0.6018.40177

Syntax

C++

Copy

public class FibonacciHeap<T> : IPriorityQueue<T>

Public Class FibonacciHeap(Of T)
	Implements IPriorityQueue(Of T)

generic<typename T>
public ref class FibonacciHeap : IPriorityQueue<T>

type FibonacciHeap<'T> =  
    class
        interface IPriorityQueue<'T>
    end

Type Parameters

T: Type of the items held by this Fibonacci heap.

The FibonacciHeapT type exposes the following members.

Constructors

	Name	Description
	FibonacciHeapT	Initializes a new instance of the FibonacciHeapT class

Top

Properties

	Name	Description
	Count	Number of elements of this heap.

Top

Methods

	Name	Description
	Clear	Clears this Fibonacci heap, removing all items.
	DecreaseKey	Decreases the key of the specified item in this heap by subtracting the passed non-negative real number delta.
	DecreaseKeyTo	Decreases the key of the specified item in this heap to the passed non-negative real number.
	Delete	Deletes the specified item from this heap.
	DeleteMin	Deletes the item with the minimum key in this heap and returns it.
	FindMin	Returns the item with the minimum key in this heap.
	Insert	Inserts the passed item with the specified key into this heap.
	IsEmpty	Checks whether this heap is empty, or not.
	Meld	Takes the union of the passed heap and this one. Assumes that both heaps are item-disjoint. This operation destroys the passed heap.

Top

Remarks

An implementation of a Fibonacci heap (abbreviated F-heap) by Michael L. Fredman and Robert Endre Tarjan which represents a very fast priority queue.

http://www.cl.cam.ac.uk/~sos22/supervise/dsaa/fib_heaps.pdf

Reference

Slash.Collections.PriorityQueues Namespace