Graph Search Toy

A toy I built to demonstrate how different graph search functions work, and the strengths and weaknesses of each of them. Includes: Breadth-First Search, Depth-First Search, Uniform-Cost Search, Heuristic Search, and A* Search, with loads of parameters to customize the specifics. It also contains several heuristics to choose from, some admissible, some inadmissible. A good example of an inadmissible heuristic failing is using A* with Double Manhattan on the 6th level.All edges that go into a nod...