A shortest path finding program. Includes a 20 x 10 graph with a GUI for setting start / end squares and placing / deleting barriers. It also includes a pull down menu to select between two path-finding algorithms (Breadth First Search and Dijkstra's algorithm). Dijkstra's algorithm enables diagonal moves which have 1.414 units of distance.