Java application designed as a learning aid for basic graph search algorithms, specifically A* search, Dijkstra’s algorithm, Depth First, Breadth First and Greedy Best-First algorithms.
Developed as part of a team of 6 for university ‘Team Project’ module assignment of creating a program for visualising an algorithm.
Implemented a system for the generation of randomised Node Graphs for visualisation and traversal by both the user and the program
