search

cc-routing / routing

12 stars 1 forks source link

Dijkstra's end condition #1

Closed blahami2 closed 8 years ago

blahami2 commented 8 years ago

Dijkstra (and A*) ends prematurely - it quits on the first hit to the TO set. Use bidirectional Dijkstra strategy - update upper bound on each hit and limit the searched distance. Test input:

From: 49.7386325,18.3118011
To: 49.7483664,18.3211994
blahami2 commented 8 years ago

Fixed