Hi Frisco, this is closest to Dijkstra’s algorithm and no heuristics. The implementation is fully optimized for finding all paths within a predetermined movement cost, rather than finding a single path of unknown movement cost. That makes it perfect for turn based strategy games where units usually have a maximum movement range per turn. For real-time games I wouldn’t recommend this, nor for non-grid based games. 
Update: Discussion moved to Marketplace thread