JuliaCollections / JuliaCollections/DataStructures.jl

Implementation of Pairing heaps and Fibonacci heaps.

Open
#500 5 comments 2 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Julia
Stars
745
Forks
261
PR merge metrics
No merged PRs in 30d

Description

I am working on a project which requires use of pairing heaps and fibonacci heaps. These are not yet implemented in DataStructures.jl . I will write my own Julia implementation of these heaps as they are important for my project.
I can contribute them to DataStructures.jl by implementing FibonacciHeap <: AbstractHeap and PairingHeap <: AbstractHeap . Are these implementation of any interest to DataStructures.jl ?

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reviewing the repository's existing heap implementations and the AbstractHeap interface before assessing the proposed FibonacciHeap and PairingHeap types. Confirm whether both implementations fit DataStructures.jl's current design and determine the expected tests and behavior before proceeding; the issue does not name specific files or acceptance tests.

Written by the indexing model from the issue text.

Assessment

Tech stack
julia
Domain
data
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
30/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.