This project was created to test graph search algorithms. There are implementations and tests for two algorithms:
- Breadth-first search
- Dijkstra's Algorithm
Algorithm code in Java 17. Tests written in Groovy 3 using Spock Framework 2.
To test the operation of the algorithms, the following sample graphs were created.
