JuliaCollections / JuliaCollections/DataStructures.jl
`IntPriorityQueue` for efficient priority queues with integer keys
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 745
- Forks
- 261
- PR merge metrics
- No merged PRs in 30d
Description
I will be creating a datastructure IntPriorityQueue which is a PriorityQueue which excepts keys from 1:n (n is the input) similar to IntDisjointSets.
This is required to increase the performance in this PR by replacing the index hash table with an array.
Should I PR the code to DataStructures.jl?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading src/priorityqueue.jl and src/disjoint_set.jl, especially the existing index hash table and the IntDisjointSets representation. Compare the proposed integer-key queue with the linked LightGraphs performance use; done means an IntPriorityQueue accepts keys from 1:n and supports the intended replacement.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100