Quote:
Pure Dijkstra Search Algorithm (fast)

Is this really true?
Using a pure Dijkstra would make the agents run the path with the least nodes not the shortest one.


Formally known as Omega
Avatar randomness by Quadraxas & Blade
http://omegapuppeteer.mybrute.com