About this visualizer

What it is

A learning assistant for the graphs part of the course. Draw a graph on a canvas — nodes and weighted edges — then watch the course's graph algorithms run on it one step at a time: breadth-first and depth-first traversal, Dijkstra's shortest paths, and the two minimum-spanning-tree builds, Prim's and Kruskal's. The same graph is shown as an adjacency matrix and adjacency list alongside, so the picture, the representation, and the algorithm stay connected.

Where the steps come from

The algorithms follow the course's own treatment of graphs: Dijkstra with a distance / previous / known table, Prim's growing a tree with a min-heap, and Kruskal's adding the lightest safe edge with union-find over disjoint sets. Every step is generated deterministically in your browser; nothing runs on a server.

Scope

Minimum spanning trees are defined for undirected graphs, so Prim's and Kruskal's are offered only in undirected mode — the directed analogue (a spanning arborescence) is a different algorithm beyond this course. Traversals and Dijkstra work on directed and undirected graphs alike.

Privacy

• Everything runs in your browser; the graphs you draw never leave it.
• No login, no accounts, no database, no AI.

Family

Part of the DSA tools family — the grid menu in the top bar lists the rest. Version 0.4.0.