Visual implementation of BFS, DFS, and A* pathfinding algorithms — built on mobile with Python

Interactive visualization of a goal-based AI agent using the A* search algorithm to solve pathfinding in a grid environment. Built with Python to demonstrate heuristic search, intelligent agents, and optimal path planning.

Solve the N-Queens problem using Simulated Annealing! Includes a graphical interface to visualize the algorithm in action, with speed control and pause/resume options.

🚀 sorting, tui-fied

An interactive Python GUI to animate and compare disk scheduling algorithms- FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK with real-time seek plots and PDF report export.

A command-line program to visualize sorting algorithms by randomizing an image and then allowing a given algorithm to re-sort it.

A collection of Manim animation scripts demonstrating UI/UX transitions, sorting algorithms, and data structures. These scripts complement the article *Using Manim for Making UI Animations* by providing real examples of visual concepts

A Python implementation of John Conway's Game of Life using pygame. This simulation of cellular automata follows simple rules to create complex, evolving patterns.

Sweeping line visualizations. Mostly angle sweeping

Interactive visualization tool for Dijkstra's shortest path algorithm built with PyQt6

A Pygame application to visualize sorting algorithms with animation, sound, and interactive controls.

A benchmarking toolkit for comparing Kruskal's and Prim's minimum spanning tree algorithms across various graph configurations, with visualization tools and performance analysis reports.

Real-time audio visualizer featuring a custom recursive Cooley-Tukey FFT implementation. Developed in Python using Pygame and NumPy to demonstrate digital signal processing algorithms.

A nice python visualizer for sorting algorithms!

Prime spiral generator written in Python.

A Streamlit-based A* Pathfinding Visualizer that lets you interactively set start/end points, barriers, and visualize the A* algorithm in real-time with step-by-step navigation. Great for learning how graph-based pathfinding works.

Python Projects for Logic & Problem-Solving

Visualize how Fortune's algorithm constructs Voronoi diagram.

CLI tool that generates SVG graphs of common algorithmic time complexities using matplotlib, with dark and light themes

mplementation and visualization of classic Divide & Conquer algorithms in Python, including Closest Pair of Points and Step-by-Step Integer Multiplication. Interactive GUI and Streamlit support for data analysis and algorithm visualization.