Explore

Lessons, write-ups and public graphs from the community — open one to run code against it.

Four nodes and five edges — a friendly place to start.

Sample 4 5

Eight nodes with a dense center — watch traversals branch and backtrack.

Sample 8 12

A perfect tree of depth two — BFS visits it level by level, DFS dives deep.

Sample 7 6

A directed, weighted graph: travel times between hubs.

Sample 5 7

Undirected weighted metro map — Dijkstra finds the fastest route (weights are minutes between stations).

Sample 8

Directed acyclic graph of course prerequisites — run a topological sort for a valid study order.

Sample 9

Page 1 of 3Next

A hundred-node maze. Run breadth-first search and watch the wavefront flood the corridors — or let Dijkstra thread a path from A to D.

Five rings, sixteen spokes. Breadth-first search ripples out from the center in perfect circles; Dijkstra runs a radius to the rim.

A complete binary tree, six levels deep, fanned into a circle. Depth-first search dives sector by sector; breadth-first sweeps the rings.

Six island clusters joined by single bridges. Searches flood one island, then leap the causeway to the next — Dijkstra island-hops from A to D.

331 cells of triangle lattice in a hexagonal disk. Breadth-first search ripples out from the center as perfect hexagons — crank the rabbit.

A river city: 24 avenues, 14 streets, three bridges, two parks and a couple of diagonal broadways. Dijkstra commutes from A to D.