Skip to content

Bidirectional Dijkstra with Contraction Hierarchies #30

Description

@gustavolgcr

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).

Activity

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

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions