views:

2040

answers:

4

Are there any heap data structure implementations out there, fibonacci, binary, or binomial?

Reference: These are data structures used to implement priority queues, not the ones used to allocate dynamic memory. See http://en.wikipedia.org/wiki/Heap_(data_structure)

Thanks, Dave

A: 

this link might help you

Igor Zelaya
+1  A: 

I don't know of any native framework implementation.

I found two implementations of binary heap (link 1, link 2) and one implementation of binomial heap in f# (link).

Jakub Šturc
A: 

I implemented a FibonacciHeap and was satisfied with its performance. Its not that hard to implement. I used the pseudocode from http://www.cse.yorku.ca/~aaw/Jason/FibonacciHeapAlgorithm.html

Steve
A: 

Free C# implementation of heaps and many other data structures:

Mitch Wheat