An interactive learning environment for exploring graph algorithms and computational geometry. Build custom inputs, step through algorithms, and inspect how their internal state changes over time.
- Breadth-first search and depth-first search
- Dijkstra's and A* shortest paths
- Bellman–Ford shortest paths
- Kruskal's and Prim's minimum spanning trees
- Editable weighted, directed, and undirected graphs
- Playback controls, pseudocode highlighting, and narration history
- Polygon drawing, validation, and area measurement
- Convex hull construction with the monotonic-chain algorithm
- Rectangle-union area using a sweep line
- Polygon containment-tree construction
- React 19 and TypeScript
- Vite
- Tailwind CSS
- Motion and Lucide icons
- SVG-based interactive canvases
Prerequisite: Node.js 18 or newer.
npm install
npm run devThe development server runs at http://localhost:3000.
npm run lint
npm run buildThis project unifies and succeeds the original Graph Algorithm Visualizer and Polygons projects.