Dijkstra Demo

A demonstration of the dijkstra pathfinding algorithm in action.

I made this as a practice implementation of the algorithm before making a version to integrate into a larger project.

Arrow keys move the selector around.

Z button - Places the starting position

X button - Places the destination position

----

Green Squares - Tiles checked while the algorithm processed.

Red Squares - the shortest path from the starting position to the destination position

Dark Blue Squares - Impassible tiles

Blue Squares - Navigable tiles

Yellow S Square - The starting position

Orange D Square- The destination position