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

Consider a custom heap instead of std::priority_queue #2

Open
jgulotta opened this issue Dec 16, 2012 · 0 comments
Open

Consider a custom heap instead of std::priority_queue #2

jgulotta opened this issue Dec 16, 2012 · 0 comments
Labels
enhancement

Comments

@jgulotta
Copy link
Contributor

The std::priority_queue creates a binary heap, which is generally quite good, but it may pay off to use a custom implementation of a Fibonacci heap, splay tree, HOT queue, indexed array, hash table, or (similar to the existing HeapSet) combination thereof.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@jgulotta