search

pharo-ai / graph-algorithms

A graph algorithms library implemented in Pharo
MIT License
22 stars 12 forks source link

Use a heap as a data structure in Dijkstra's algo instead of a OrderedCollection for the priority queue #5

Closed jordanmontt closed 1 year ago

jordanmontt commented 2 years ago

The ordered collection is the naive implementation of the priority queue. We should use other data structure to improve the time complexity of our implementation of Dijkstra

nikhil061102 commented 1 year ago

I think we can discuss and solve this problem. By the way, I am new to open source contributions so this will be a good start for me :)

jordanmontt commented 1 year ago

Yes, it would be really cool :) The idea of this issue is to develop the heap, or priority queue data structure. It is not an easy tasks. If you have ideas or experience on how to do it please share them

Ducasse commented 1 year ago

I think that there is already a Heap Datastructure in Pharo.

jordanmontt commented 1 year ago

Fixed in #f8c72fcc209dd9f4e0683b89fc49e6896e8d50cd