GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - TamimEhsan/AlgorithmVisualizer: A better visualization of different algorithms made with React

BranchesTags
Open more actions menu

Latest commit

 

History

76 Commits
76 Commits

Folders and files

NameName
Last commit message
Last commit date
.github/workflows
.github/workflows
 
 
Assets
Assets
 
 
public
public
 
 
src
src
 
 
.gitignore
.gitignore
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 
REFACTOR.md
REFACTOR.md
 
 
components.json
components.json
 
 
eslint.config.mjs
eslint.config.mjs
 
 
jsconfig.json
jsconfig.json
 
 
next.config.mjs
next.config.mjs
 
 
package-lock.json
package-lock.json
 
 
package.json
package.json
 
 
postcss.config.mjs
postcss.config.mjs
 
 
tailwind.config.js
tailwind.config.js
 
 

Repository files navigation

banner

Algorithm Visualizer

A better visualization of different algorithms made with React.

Visit : https://tamimehsan.github.io/AlgorithmVisualizer/

Visitor Count

Explore more than 30 algorithms with step by step visualization simplifying the learning process and making it more engaging for a better understanding.

So far there are these segments

  • Pathfinder
  • Graph Traversal (BFS / DFS)
  • Shortest Path
  • Minimum Spanning Tree
  • Connectivity
  • Network Flow
  • Prime Numbers
  • Sorting Algorithms
  • N Queen
  • Convex Hull
  • Binary Search Game
  • Binary Search Tree
  • Recursion Tree
  • Turing Machine
  • Game of Life
  • Linked List

I have implemented a total of 30+ algorithms so far. And will try to add more later.

Algorithms implemented

  • Graph Search
    • DFS
    • BFS
    • Dijkstra
    • A star
    • Recursive Maze Creation
  • Data Structures
    • Linked List (insert, delete, search, reverse — singly & doubly)
  • Trees
    • Binary Search Tree (insert, delete, search with animated re-layout)
  • Graph Traversal
    • BFS
    • DFS
  • Single Source Shortest Path
    • Dijkstra
    • Bellman-Ford
  • Minimum Spanning Tree
    • Kruskal
    • Prim
  • Connectivity
    • Connected Components
    • Strongly Connected Components (Tarjan)
    • Weakly Connected Components
  • Network Flow
    • Edmonds-Karp
    • Ford-Fulkerson
    • Min Cut
  • Sorting
    • Bubble sort
    • Selection sort
    • Insertion sort
    • Heap sort
    • Merge sort
    • Quick sort
  • Prime Numbers
    • Sieve or Eratosthenes
    • Archimedes Spiral
  • N Queen Backtracking
  • Graham Scan for Convex Hull
  • Binary Search
  • Recursion
    • Fibonacci Number
    • Binomial Coefficient
    • Derangement
    • Fast Exponentiation
    • Stirling Number of Second Kind
  • Turing Machine
    • Bitwise NOT
    • Increment one
    • 2's Compliment

Contribution

I am not sure if anyone would like to contribute to this project or not. But any kind of contributions are welcomes. Also if you like this please star this repo. It keeps me motivated.

Special Features addition timeline

  • Commit 16: Added Flip Move animation to inplace sorting components
  • Commit 20: Added Tree Structure
  • 13 Dec 2024: Release v2.0.0: Migrate the project from legacy project to next js with shadcn ui #3
  • Jun 2026: Added Linked List visualizer (singly & doubly) with staged insert/delete animations
  • Jun 2026: Added interactive Graph Traversal (BFS / DFS) built on React Flow
  • Jun 2026: Added Shortest Path (Dijkstra / Bellman-Ford) and Minimum Spanning Tree (Kruskal / Prim) on a shared, reusable graph workspace
  • Jun 2026: Added Connectivity (components / SCC / WCC) and Network Flow (Edmonds-Karp / Ford-Fulkerson, max flow / min cut)
  • Jun 2026: Added a reusable SVG tree component with a Binary Search Tree visualizer, and migrated the Recursion Tree onto it

Acknowledgement

I took inspirations from the following sources for some of the segments.

  • Pathfinder: The Projects That Got Me Into Google
  • Archimedes Spiral for Primes: Why do prime numbers make these spirals?
  • Recursion tree visualizer: Recursion Tree Visualizer
  • Turing Machine: Tursi

Run locally

Make sure you have node installed in your system. Then run

npm i
npm run dev

This will start the app in http://localhost:3000/AlgorithmVisualizer

Inspiration for next sections

  • University of San Francisco Site
  • ​algorithm-visualizer
  • National University of Singapore Site

About

A better visualization of different algorithms made with React

tamimehsan.github.io/AlgorithmVisualizer/

Topics

algorithmalgorithm-visualizationalgorithm-visualizeralgorithmsbinary-searchn-queennextjspathfinderreactreactjsshadcn-uisortingsorting-algorithmsvisualizations

Resources

Readme
MIT license
Activity

Stars

453 stars

Watchers

6 watching

Forks

113 forks
Report repository

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.