In addition to finding a shortest path, these algorithms can be used for distance maps, flow field pathfinding, connected components, map analysis, garbage collection algorithms, flow networks, and procedural map generation. There are many optimizations and specializations of these algorithms. Representing the map#The first thing to do when studying an algorithm is to understand the data. What is
{{#tags}}- {{label}}
{{/tags}}