Interactive Computer Science
Run Kruskal's and Prim's to pick the cheapest edges that connect the graph.
Run Dijkstra's, Bellman-Ford and Floyd-Warshall to surface every shortest path.
Run Breadth-First and Depth-First Search, tracking the queue, the stack and the visited set.
Run Ford-Fulkerson and Edmonds-Karp to push the maximum flow through a network and surface its minimum cut.
Wire up states, set transition probabilities and read off the classes, periodicity and stationary distribution.
Create sets and write queries that light up the regions they select.
Build automata, feed them strings and step through every state the input drives them into.
Wire up random variables, set their conditional tables and propagate evidence through the network.
Insert and remove values and run rebalancing strategies.
Insert and look up keys, watching collisions resolve and the table grow as it fills.
