The following program is about Visualizing algorithms. The project is not fully complete yet will make changes in future.
The project contains the following algorithms:
- Britism Museum Search
- Depth First Search
- Breadth First Search
- Hill Climbing Search
- Beam Search
- Oracle Search
- Branch and bound
- Branch and bound plus extension list
- Branch and bound plus estimated heuristics
- A star