Fix BidirectionalShortestPath from one node to itself. #36

Open

Assignees

Labels

Milestone

kNN with Contraction Hierarchies

opened

on Mar 14, 2017

Analyze the case where the from and to nodes from a ShortestPath are the same. The algorithm should return distance/cost equal to zero. Currently, the algorithm is trapped in a loop.

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

Metadata

Assignees

gustavolgcr

Labels

Type

No type

Projects

No projects

Milestone

kNN with Contraction HierarchiesNo due date

Relationships

None yet

Development

No branches or pull requests