Hi all,
I was wondering the reason why shortest path preprocessing isn’t an option in the map-matching algorithm. I mean, compute shortest paths for each node first, save it, then use it as a lookup table during map-matching.
I know CH exists but it looks like it will add more time because CH shortcuts need to be unpacked to produce the actual route.
Thank you.