Revision project to implement a variety of graph searching algorithms in a modular way.
- Tree Search
- Breadth- and Depth- First Search
- Lowest Cost First Search
- Graph Search
- BFS, DFS and LCF again
- Greedy Heuristic Search
- A* Search
Includes options for cycle checking and early exit (on path found) for both tree and graph searches. A further option for multi-path pruning is available for graph searches.