Traversal, flood fill, and exploring connected components.
Decide if all courses can be finished — i.e. the prereq graph has no cycle.
Make a deep copy of an undirected graph — every node and edge duplicated.
Count connected components of land in a 2-D grid.
Is this graph a tree? Exactly n−1 edges and no cycles.