Muhammad Abdullah

Project

Pathfinding Visualizer

See how algorithms think.

screenshot coming soon

Overview

Renders a 40×40 interactive grid — draw walls, place start/end nodes, then watch.

Supports A*, Dijkstra's, and BFS, each with animated step-by-step traversal.

Built with vanilla JS — no libraries, no frameworks, state managed by hand.

Highlights the shortest path after traversal completes.

Stack

JavaScript, HTML, CSS

Status

Complete

view on github ↗