Detect a cycle in a directed graph

Decide whether a directed graph contains a cycle, using depth-first search with node states or Kahn's topological sort. Variants that came up: start with a linked list (fast and slow pointers), then let each node have several children; and, given a graph of items and a new edge, decide whether adding that edge would create a cycle.