Pathfinding Algorithms

This project was developed for the first part of my year 2 module Data Structures and Algorithms at university. The goal of the project is to implement two different standard algorithms to solve the same real-world problem. The application needed to make use of appropriate data structures and allow for comparison of performance and varying the size of input data.

The problem tackled is pathfinding on a 2D grid. To achieve this, two pathfinding algorithms have been explored; Lee's and A*. 

In conclusion, findings indicate A* has overall better performance and consistency. The performance findings of the project are discussed in further detail in the presentation.