Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Priority Queue #10

Open
sfwhite opened this issue Jan 1, 2022 · 0 comments
Open

Priority Queue #10

sfwhite opened this issue Jan 1, 2022 · 0 comments

Comments

@sfwhite
Copy link

sfwhite commented Jan 1, 2022

Have you considered switching out from your own priority queue implementation to a Fibonacci Heap implementation? FH has one of the best amortized runtimes for Dijkstra implementations.

The mnemonist library has an implementation that's stable.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sfwhite