Dijkstra's Algorithm - Maze

This is a demo of using Dijkstra's algorithm for pathfinding. 
I have finally come to understand the algorithm and thought this was an interesting application of it.

I'm excited for some future games which I can now make.

(I will improve the efficiency of the path finding by adding the heuristic, characterising the A* algorithm)

In this demo the player (red square) is pursued by the enemy (blue square).

I implemented a grid based system where both enemy and player are constrained to movement in north, south, east and west directions and cannot move through walls.

//Controls: WASD or Arrow Keys