(Question) Difference between matching algorithms #4
Description
Is there a reason why you chose the dijkstra algorithm for map matching and why you didn't go for the viterbi algorithm?
Personally it seems the viterbi algorithm fits the map matching better than the dijkstra because of the integration of speed and probability to find the most probable match. In my opinion this implementation of probability outweighs the downsides of longer computing times or the higher complexity.
As a suggestion: you could add the choice between the two algorithms (fast vs precision) and have the user decide whether the dijkstra is good enough or whether they wish for a more exact result by using the viterbi algorithm.