Initial commit: Algorithm Visualizer with pathfinding and sorting algorithms

Author: Beckash

.github/workflows/ci.yml

@@ -0,0 +1,21 @@
+name: CI
+
+on:
+  push:
+    branches: ["**"]
+  pull_request:
+
+jobs:
+  validate:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-node@v4
+        with:
+          node-version: 20
+          cache: npm
+      - run: npm ci
+      - run: npm run lint
+      - run: npm run typecheck
+      - run: npm test
+      - run: npm run build

.gitignore

@@ -0,0 +1,9 @@
+/node_modules
+/.next
+/out
+/coverage
+*.log
+.env*
+!.env.example
+.DS_Store
+*.tsbuildinfo

README.md

@@ -0,0 +1,65 @@
+# Traverse — Algorithm Visualizer
+
+An interactive, static visualizer for graph traversal and sorting algorithms. Draw a board, add weighted terrain, generate a maze, and inspect each decision with full playback controls.
+
+The live demo and demo GIF will be added after the repository is connected to Vercel.
+
+## Features
+
+- BFS, DFS, Dijkstra, and A* pathfinding on a 50 × 25 grid
+- Click-and-drag walls, Shift-drag weighted cells, and draggable endpoints
+- Keyboard grid controls with arrow navigation and wall, weight, start, and target shortcuts
+- Randomized depth-first maze generation
+- Bubble, insertion, selection, merge, and quick sort
+- Play, pause, single-step, scrub, reset, and steps-per-second controls
+- Pure algorithm engines with no React or DOM dependencies
+
+## Architecture
+
+Every algorithm accepts plain data and returns a flat list of animation steps. The UI is only a player for that list. This keeps the engines deterministic and unit-testable, and makes timeline controls simple.
+
+The pathfinding grid renders once and stores cell elements in a ref map. During playback, only changed classes are updated inside a `requestAnimationFrame` loop. Sorting uses ordinary React state because its arrays are much smaller.
+
+## Complexity
+
+| Algorithm | Time | Notes |
+| --- | --- | --- |
+| BFS | O(V + E) | Shortest path on unweighted grids |
+| DFS | O(V + E) | Does not guarantee a shortest path |
+| Dijkstra | O((V + E) log V) | Optimal with non-negative weights |
+| A* | O((V + E) log V) worst case | Manhattan-distance heuristic |
+| Bubble sort | O(n²) | In-place, stable |
+| Insertion sort | O(n²) | Adaptive on nearly sorted input |
+| Selection sort | O(n²) | Minimizes swaps |
+| Merge sort | O(n log n) | Stable, O(n) auxiliary space |
+| Quick sort | O(n log n) average | O(n²) worst case |
+
+## Run locally
+
+```bash
+npm install
+npm run dev
+```
+
+Open [http://localhost:3000](http://localhost:3000).
+
+```bash
+npm run lint
+npm run typecheck
+npm test
+npm run build
+```
+
+## Deploy
+
+Import the repository into [Vercel](https://vercel.com/new). No environment variables, backend, or database are required.
+
+After deployment:
+
+1. Add the Vercel project URL near the top of this README.
+2. Record a short pathfinding-to-sorting demo as `docs/demo.gif`.
+3. Link the GIF to the live deployment.
+
+## Stack
+
+Next.js 15 App Router · React 19 · TypeScript · Tailwind CSS v4 · Vitest

eslint.config.mjs

@@ -0,0 +1,13 @@
+import { dirname } from "node:path";
+import { fileURLToPath } from "node:url";
+import { FlatCompat } from "@eslint/eslintrc";
+
+const __filename = fileURLToPath(import.meta.url);
+const __dirname = dirname(__filename);
+const compat = new FlatCompat({ baseDirectory: __dirname });
+const config = [
+  { ignores: [".next/**", "node_modules/**", "coverage/**", "next-env.d.ts"] },
+  ...compat.extends("next/core-web-vitals", "next/typescript"),
+];
+
+export default config;

next-env.d.ts

@@ -0,0 +1,6 @@
+/// <reference types="next" />
+/// <reference types="next/image-types/global" />
+/// <reference path="./.next/types/routes.d.ts" />
+
+// NOTE: This file should not be edited
+// see https://nextjs.org/docs/app/api-reference/config/typescript for more information.