Hi,

i am still looking for a generic priority queue in the .NET-Framework. Is there anything in the F#-libraries?

Best regards,
Steffen

The built-in Set module provides logarithmic-time insertion, min element and removal which is all you need for a heap. If you have duplicate elements, augment them with a unique ID.

Cheers,
Jon.

By on 7/30/2010 10:33 AM ()

The implementation described at page 42 here (pairing heap) works great and it's easy to implement.

By on 7/31/2010 4:15 AM ()

Hi, I have one implemented in C# using generics. Do you want it?

By on 9/17/2008 4:49 AM ()

Hi yahez,

at the moment I am using the IntervalHeap from [link:www.itu.dk]
It is working realy nice, but I wonder if there is any native way to use a priority queue.

I thought if it is not in the .NET-Framework, maybe the F#-Team would implement such a collection.

Regards Steffen

By on 9/17/2008 5:07 AM ()
IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy
Built with WebSharper