https://github.com/linsanity03/algorithm_visualizer
Algorithm visualizer game with pygame showcasing visualization of Popular algorithms
https://github.com/linsanity03/algorithm_visualizer
algorithm algorithm-visualization algorithms data-structures-and-algorithms pygame python python3 shortest-path-algorithm
Last synced: 3 months ago
JSON representation
Algorithm visualizer game with pygame showcasing visualization of Popular algorithms
- Host: GitHub
- URL: https://github.com/linsanity03/algorithm_visualizer
- Owner: LINSANITY03
- License: mit
- Created: 2023-11-04T11:57:37.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2023-12-10T22:31:38.000Z (over 1 year ago)
- Last Synced: 2025-02-10T14:25:51.804Z (4 months ago)
- Topics: algorithm, algorithm-visualization, algorithms, data-structures-and-algorithms, pygame, python, python3, shortest-path-algorithm
- Language: Python
- Homepage:
- Size: 565 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: Readme.md
Awesome Lists containing this project
README

# Algorithm Visualizer
This is a game written in Python to show visualization of popular algorithms. Currently, A star algorithm is visualized to find shortest path in this game with more addition incoming.
### Tech stack used:
- Python (3:10)
- Pygame
- Figma to create any background, button images## How to play?
- Clone the github repository.
```
git clone https://github.com/LINSANITY03/Algorithm_Visualizer.git
```- Create a virutal env and install the requirements.
```
python virtualenv venv
venv\Scripts\active
pip install -r requirements.txt
```- Run the AlgoMain.py file.
```
python AlgoMain.py
```## Rules:
- Source and destination points are required to start.
- Walls can be selected multiple times or None.
- A \* algorithm can search in all 8 directions representing straight and diagonals cells.
- Green colour represents source.
- Red colour represents Destination.
- Brown colour represents walls.
- Blue colour represents visited cell.
- Path if existed is represented by Black colour## Output:
![]()
## Future Integration:
- Main menu layout
- More path finding algorithm integration such as Dijkstra's, Breadth-first, depth-first.
- Comparison of different algorithm.
- Addition of sorting algorithms.
- Automate testing.## Collaboration
Feel free to use this codebase for your projects. If you want to talk more about this project or have found bugs, create a pull request or contact me on **[email protected]**.