Maze Solver & Visualizer – DFS vs BFS Algorithm Visualization (Final Semester Project)
Автор: Anyname
Загружено: 2025-12-09
Просмотров: 14
Описание:
Maze Solver & Visualizer – Final Semester Project
In this project, I built an interactive Maze Solver and Visualizer that demonstrates how Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms explore and navigate a maze.
The goal is to give a clear visual understanding of both algorithms’ behaviours, their differences, and how they approach solving the same maze under different conditions.
✨ Features
Random Maze Generation (Press G)
Generates a new maze with a random start and end point.
Algorithm Solving (Press S)
Visualizes the selected algorithm step-by-step.
Speed Control (Press + / -)
Increase or decrease visualization speed.
Algorithm Toggle (Press 1 / 2)
1 → Depth-First Search (DFS)
2 → Breadth-First Search (BFS)
Quit Application (Press Q)
🎯 Purpose of the Project
This visualizer helps students and developers better understand how DFS and BFS operate in maze scenarios by showing their exploration pattern and final path in real time.
🛠️ Technologies Used
Python
Pygame (or specify your graphics library)
Data structures & algorithms
📌 About This Video
This video is part of my final semester project submission.
I’m uploading it to YouTube as recommended by my professor, both for evaluation and as part of my portfolio.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
