search

cyang-kth / fmm

Fast map matching, an open source framework in C++
https://fmm-wiki.github.io/
Apache License 2.0
878 stars 205 forks source link

The transition graph should be partly connected #205

Closed cyang-kth closed 2 years ago

cyang-kth commented 2 years ago

The current implementation will create a fully connected transition graph where candidates with the shortest path distance not found will still be connected with a distance of positive infinity. This design is problematic as the transition probability of 0 may still be returned as the optimal path.

To address this issue, avoid creating a connection if there is no path found between two candidates so that it can be guaranteed that an optimal path found from the transition graph could always be found.

cyang-kth commented 2 years ago

Feature already implemented. It will be pushed after our next paper is published.