Find the fewest edges to get from a starting node to every other node in an unweighted graph.
Walk every reachable node in a graph by going as deep as possible before backtracking, using a stack.
Walk every reachable node in a graph by going as deep as possible before backtracking, using recursion.
Determine whether an undirected graph contains any loop.
Count how many disconnected groups of nodes exist in a graph.
Find the minimum number of dice rolls to reach square 100 on a snakes-and-ladders board.
Rotten oranges spread to adjacent fresh oranges each minute. How long until all are rotten?
Flip all O regions to X, except those connected to the border of the board.