intro

Algorithms & Data Structures

Learn by seeing.
Ship with Athro.

A TypeScript library with interactive visualizations for every algorithm. Built for developers who want clarity, not just code snippets.

Get startedView on npm

Explore

Sorting

8 algorithms

Bubble, merge, quick, heap, counting, and radix sort with live bar-chart visualizations.

Read docs →

Searching

4 algorithms

Linear, binary, jump, and exponential search with step-by-step index highlighting.

Read docs →

Graphs

New

BFS, DFS, Dijkstra's shortest path, and topological sort on weighted graphs.

Read docs →

Data Structures

7 structures

Linked lists, stack, queue, heap, hash map, BST, and graph adjacency lists.

Read docs →

Install

npm install athro

Quick example

import { heapSort, Graph, graphBfs, dijkstra, HashMap } from 'athro';

heapSort([8, 3, 6, 1]);

const map = new HashMap<string, number>();
map.set('key', 42);

const graph = new Graph<string>(true);
graph.addEdge('A', 'B', 4);
graphBfs(graph, 'A');
dijkstra(graph, 'A', 'B');

Why Athro?

Every algorithm page includes an interactive visualization — play, pause, and step through each operation before using it in production code. The library ships dual CJS + ESM builds with full TypeScript declarations.

Compatibility

Works everywhere JavaScript runs — Node.js, Deno, Bun, and modern browsers.