The A* Algorithm is a pretty simple algorithm. It manages pathes by how long they are, and how long it estimates it will take for them to reach the destination. By managing all of these different paths at the same time it can guarantee that the final path is the fastest possible. You can experiment with "highways" by clicking nodes to create hubs. Paths between hubs go 3 times as fast as regular paths.

Source code: Routing a_star heap

Built with Processing

Back