LouisJenkinsCS / Distributed-Data-Structures

[GSoC] Distributed Data Structures - Collections Framework for Chapel language
https://summerofcode.withgoogle.com/archive/2017/projects/6530769430249472/
BSD 3-Clause "New" or "Revised" License
15 stars 2 forks source link

Addition of Priority Queue #29

Open nimitbhardwaj opened 6 years ago

nimitbhardwaj commented 6 years ago

One day, I had a need for a priority queue implementation, I thought that there would be a module like collections, and here it is, but again here is no Priority queue implementation here, so I was hoping to have a distributed priority queue implementation which may seems handy many times in the computer science, like in the implementation of Djikstra's algorithm or prim's or kruskal's algorithm there is a need of a priority queue, so was hoping of it.

nimitbhardwaj commented 6 years ago

One day, I created an implementation of priority queue, so was hoping, if I could create the implementation, I created it in C, you may see it here, this was a simple implementation using Heaps, but now I plan to implement a Priority queue using fibonacci heap. Please provide your views.

LouisJenkinsCS commented 6 years ago

Hey @nimitbhardwaj please direct this question to this thread. This repository is frozen for GSoC viewing and the code has been integrated into Chapel as of release 1.16