This repository supplements our mobile app "VisiGrab: Algorithms & DSA", which offers interactive visualizations of algorithms and data structures. It provides code for the concepts demonstrated in the app and is an essential resource for users seeking to understand and explore these implementations in detail. Learn more about the app: App Store, Google Play.
- Binary Trees — BST (Standard, AVL, Red-Black), In-order / Pre-order / Post-order / Breadth-first traversals
- Graphs — BFS/DFS traversal, Dijkstra, Bellman-Ford, Minimum Spanning Tree (Kruskal, Prim). The app also features an interactive Graph Constructor — tap to add vertices, drag between them to add edges, and watch the algorithms run on your custom graph in real time.
- Linear Data Structures — Array, Linked List, Stack, Queue
- Sorting — Bubble, Insertion, Selection, Merge, Quick (Lomuto & Hoare), Heap Sort
- Hash Table
- Union-Find
While this project is open-source, it is not currently seeking contributions. You are welcome to fork and use the code according to the license, but please note that contributions or pull requests to this repository will not be accepted.
Before you begin, ensure you have installed the latest version of Python. This project is compatible with Python 3.x.
To clone and run these examples locally, follow these steps:
git clone https://github.com/Lord-of-Algorithms/DSA-in-Python.git
cd DSA-in-Python
All commands must be run from the project root (DSA-in-Python/). The -m flag tells Python to resolve imports relative to the current directory — running from any other location will result in a "module not found" error.
cd DSA-in-Python
Then run any example:
python3 -m binary_tree.bst_main
python3 -m graph.dijkstra.dijkstra_main
python3 -m linear_ds.queue.queue_main
python3 -m sorting.quick.quick_sort_main
python3 -m hashtable.hash_table_main
This project is licensed under the MIT License. See the LICENSE file for more details.