JuliaGraphs / JuliaGraphs/Graphs.jl
Custom priority queues for Dijkstra & Co
Open
@gdalle is already working on this.
Since May 19, 2022.
enhancement
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
At the moment, shortest path algorithms such as Dijkstra and A* rely on the standard PriorityQueue from DataStructures.jl, partly because it supports updating the priority value of a stored element.
However, there are alternative implementations that do not require this property, and those can be faster in many cases.
Would it make sense to add a method that lets the user choose the priority queue they want, along with the version of the algorithm (with or without priority updates)?
Contributor guide
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.
Assessment
This issue has not been assessed yet.