Explore

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

Directed weighted task network — the critical path is the longest route from Kickoff to Launch (weights are days).

Sample 8 9

Directed weighted flow network — edge weights are pipe capacities; find the max flow from Source to Sink.

Sample 6 8

Directed weighted airline network — shortest path finds the quickest itinerary (weights are hours in the air).

Sample 8

Directed food web — arrows point from prey to predator (energy flow). Trace food chains and trophic levels.

Sample 9

Directed weighted currency graph — weights are conversion fees (basis points); Dijkstra finds the cheapest conversion path.

Sample 6 11

Directed follower graph — who follows whom. Explore cycles, reach, and PageRank-style influence.

Sample 8 11

Undirected weighted grid — weights are cable kilometers; a minimum spanning tree is the cheapest way to wire every node.

Sample 8

Directed weighted DAG (weights are lead-time days) — the longest path from a raw material to a store is the supply chain's critical path.

Sample