Depth-first Search

Problems on depth-first search, including connected components, cycle detection, entry and exit times, bridges and articulation points, strongly connected components, topological sorting, and traversals of trees and grids.

The Graphs section of the library covers depth-first search, connected components, cycle detection, strongly connected components and topological sort. Related problem sets are under Graphs and Trees.