Pathfinding Juxtaposed

Three path-finding algorithms demonstrated side by side: Dijkstra's, A*, and greedy best-first.

Did you see my demonstration of A* (http://www.mathworks.com/matlabcentral/fileexchange/26723-demonstration-of-astar-a), but still wanted more? Now you can have it, and if you download now you will also receive two other path-finding approaches: Dijkstra's algorithm, and greedy best-first. What is more, in the main script (demoall.m), you can change the size of the fields, the percentage of walls, and the distance measure used for calculating the heuristics. Also, for this limited time, you can change how the influence map is initialized, by editing the initialeField script!