Find all paths in a single iteration?

Hello everyone, So I’m making a randomly generate dungeon game, and I’m using A* to find the shortest path between rooms so every room is connected by a corridor. So lets say I have 500 rooms. All 500 rooms need to be connected to each other. That means I need to find the shortest path between all rooms and connect them by a corridor. So what I do is I run A* algorithm 500 times to find a path for each room. lets say the time it takes for A* to find a path is 100ms. so that’s 500 * 100ms = 50,000 ms or 50 seconds. Now in my engine I have A* multi-threaded. So I can run multiple threads to find the paths at the sometime. Lets say…


Link to Full Article: Find all paths in a single iteration?