This project is a C# desktop application developed for our 2nd Year Design and Analysis of Algorithms (DAAlgo) course.
It focuses on implementing and demonstrating different search algorithms with graph traversals:
- BFS (Breadth-First Search)
- DFS (Depth-First Search)
- UCS (Uniform Cost Search)
- GBFS (Greedy Best-First Search)
The goal is to provide both a learning tool and a practical implementation of search strategies used in AI and algorithm design.
- 🖥️ Desktop GUI (built with C# Windows Forms or WPF).
- 📊 Graph Visualization – represent nodes and edges visually.
- 🔄 Traversal Animations – step-by-step exploration of nodes.
- ⚡ Multiple Algorithms – run BFS, DFS, UCS, and GBFS on the same graph for comparison.
- 📈 Pathfinding & Cost Tracking – view traversal order, path, and (for UCS/GBFS) cost values.
- Language: C#
- Framework: Windows Forms
- Course: Design and Analysis of Algorithms (2nd Year, College)
- Clone the repository:
git clone https://github.com/earlfranciss/Search-Algorithms-Visualizer.git
- Open the solution in Visual Studio.
- Build and run the project.
This project was developed as part of the Design and Analysis of Algorithms course to:
- Practice implementing graph-based search algorithms.
- Explore algorithm efficiency, traversal patterns, and pathfinding strategies.
- Gain hands-on experience building interactive algorithm visualizers in C#.
- Earl Francis Y. Ong