Ahnaf Shahriar Asif
Developed a 2D Graph Algorithm Visualizer, a web-based application designed to help users understand and visualize fundamental graph algorithms such as Breadth-First Search (BFS) and Depth-First Search (DFS). The application provides an interactive platform for users to experiment with graph algorithms visually and intuitively, enhancing learning and comprehension of these essential computer science concepts.
Key Features:
Algorithm Visualization: Supports visualization of BFS and DFS on a 2D grid, allowing users to see the step-by-step execution of these algorithms.
Interactive Grid: Users can create custom grids, place start and end points, and add obstacles to simulate various scenarios.
Real-time Updates: Visual updates in real-time as the algorithm progresses through the grid.
Educational Tool: Ideal for students and educators as a teaching aid to demonstrate how graph algorithms work.
Technologies Used:
Frontend: VueJS
Deployment: GitHub Pages
Links:
Source Code: GitHub Repository