A flow field: the least cost from every tile to the nearest goal (the
"integration field"), plus a pointer from each tile to the next tile along a
shortest route. Computed once with a multi-source Dijkstra, it lets any
number of units share one route computation — the efficient complement to
per-unit A* when a swarm converges on the same target.
A flow field: the least cost from every tile to the nearest goal (the "integration field"), plus a pointer from each tile to the next tile along a shortest route. Computed once with a multi-source Dijkstra, it lets any number of units share one route computation — the efficient complement to per-unit A* when a swarm converges on the same target.