Instead of repeated A*, try [Floyd-Warshall](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) or [Johnson's](https://en.wikipedia.org/wiki/Johnson%27s_algorithm). Is there an "all-in-one" algorithm for this problem? ## Resources * https://en.wikipedia.org/wiki/Shortest_path_problem * https://en.wikipedia.org/wiki/Travelling_salesman_problem * https://aigamedev.com/open/highlights/pathfinding-multiple-destinations/