[FrontPage] [TitleIndex] [WordIndex

Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.

A connected component of an undirected graph is a maximal subset V' of the vertices with the property that every vertex in V' is reachable from every other vertex in V' (the maximal part means that there is no larger subset with this property). Any graph can be partitioned into its connected components by computing a DFS forest using DepthFirstSearch.

If the graph is directed, the analogous notion is a strongly-connected component (see StronglyConnectedComponents).


2014-06-17 11:58