Including Fibonacci Heaps in DataStructures.jl

JuliaCollections / DataStructures.jl

Julia implementation of Data structures

https://juliacollections.github.io/DataStructures.jl/latest/

MIT License

683 stars 243 forks source link

Including Fibonacci Heaps in DataStructures.jl #583

Open karan0299 opened 4 years ago

karan0299 commented 4 years ago

A Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structures including the binary heap and binomial heap. So ,should we include Fibonacci Heap in this package?

oxinabox commented 4 years ago

Feel encouraged to make a PR

karan0299 commented 4 years ago

Sure ,I will make a PR shortly. Thanks.