DSA Graph Visualizer

Draw a graph — add nodes and connect them with weighted edges, or load one of the course examples — then run BFS, DFS, Dijkstra's, Prim's, or Kruskal's on it and step through the trace.

Build a graph

Minimum spanning trees need an undirected graph; traversals and Dijkstra work with either.

The shortest-path graph from the course (A–E).

The minimum-spanning-tree graph from the course (A–G).

Click empty space to add a node. Drag a node to move it. Click a node or edge to select it, or click an edge's number to retype its weight.

Adjacency matrix

Add nodes to see the matrix.

One row and column per vertex; the cell is the edge's weight. Compact for a dense graph — every pair has a slot.

Adjacency list

Add nodes to see the list.

Each vertex lists only the neighbours it actually connects to, with the edge weight in parentheses. Compact for a sparse graph.