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.

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

Support a max-heap implementation #6

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

Support a max-heap implementation #6

jgulotta opened this issue Dec 17, 2012 · 0 comments

Comments

@jgulotta
Copy link
Contributor

Currently the implementation uses a min-heap and so always finds the least expensive path. In some cases it is possible to find the most expensive path by pre-processing the input and negating values, but this is not always feasible. It would be good to allow finding the most expensive path through the use of a max-heap.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant