Dijkstra.m

This code and associated function was written by Dimas Aryo. Full documentation can be found here, on the Mathworks file exchange.

PathFinder uses Dijkstra’s shortest path algorithm to find the shortest path as part of shortestInfinitePath.m.