Do I need to install anything?

No. It runs in any modern browser, free, with no account required.

For Students · k-Means Clustering

k-Means Clustering for a Dijkstra route

Built for students learning it for a class or exam. See the concept move instead of memorizing formulas — and check your homework intuition. Simulate a Dijkstra route live below — adjust the inputs and watch it respond, right in your browser.

k-Means ClusteringLive

Lloyd's algorithm · live

Controls

Speed1×

Presets

k (centroids)

True clusters

Lloyd's algorithm: assign each point to its nearest centroid, then move each centroid to the mean of its members. Repeat until stable. Try setting k different from the true cluster count.

▶ Run in Python

Data Inspector

Iteration0

Inertia0.00e+0

Governing equation

J = k = 1 \sum 4 x \in C_{k} \sum ∥ x - μ_{k} ∥^{2}, μ_{k} = \frac{1}{∣ C _{k} ∣} x \in C_{k} \sum x

Reading this result: k matches the 4 true clusters, so each centroid can settle onto one real group and inertia falls to a clean minimum.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

Also for:Researchers Educators Engineers Hobbyists & Makers K-12 Students First Responders General version →

More with k-Means Clustering

k-Means Clustering for a neural network k-Means Clustering for a sorting algorithm k-Means Clustering for a search tree k-Means Clustering for a hash table k-Means Clustering for a recommendation engine k-Means Clustering for an image classifier k-Means Clustering for a chatbot k-Means Clustering for a pathfinding AI

Frequently asked questions

Is this good for students?: Yes — this version of "k-Means Clustering for a Dijkstra route" is framed for students learning it for a class or exam. See the concept move instead of memorizing formulas — and check your homework intuition.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.