One to many Algo how use it

Let’s say you are at coordinate A and you have 50 parties.
How to find the nearest party the route? Run 50 times? Or use oneTo Many Dijkstra ?

You could use and stop the search once you found a party (it will be the closest one).

This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.