Built to help visualize common computer science algorithms.
Report Bug
·
Request Feature
Demo of DFS, BFS, and Dijkstra's
AlgoVisualizer is built for visualizing common sorting and path-finding algorithms. Some examples include: quick sort, merge sort, counting sort, DFS, and Dijkstra's algorithm. All algorithms are implemented in Python and are displayed using the Pygame library.
- Python
- Pygame
To get a local copy up and running, follow these simple steps.
-
Verify if python (Version >= 3.8) is installed. Previous versions may also work.
python --version
- If not, go to https://www.python.org/downloads.
- If not, go to https://www.python.org/downloads.
-
Verify if pip is installed
pip --version
- Clone the repo
git clone https://github.com/dgobalak/AlgoVisualizer.git
- Create a virtual environment
python -m venv .venv
- Activate the virtual environment
.venv\scripts\activate
- Install dependencies
pip install -r requirements.txt
- Start the app.
python main.py
Distributed under the Apache 2.0 License . See LICENSE
for more information.
- Daniel Gobalakrishnan - [email protected]
- Project Link: https://github.com/dgobalak/AlgoVisualizer