This is a project from my CSE 331 Algorithms & Data Structures course where I wrote and implemented Breadth-First and A* searches to find the shortest path through a weighted graph.
Check 'specs.md' if you'd like to see the project outline and requirements.