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

Bidirectional Dijkstra with Contraction Hierarchies #30

Open

gustavolgcr opened this issue Aug 30, 2016 · 0 comments

Assignees

Labels

Milestone

kNN with Contract...

Member

gustavolgcr commented Aug 30, 2016

Implementation of the Bidirectional Dijkstra algorithm with the Contraction Hierarchies speed up technique.

Tests should be performed with the current graphs and compared with the regular Dijkstra Bidirectional algorithm (execution time and path returned).

gustavolgcr added the enhancement label

gustavolgcr added this to the kNN with Contraction Hierarchies milestone

gustavolgcr self-assigned this

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