A strongly connected component is a maximal subset of the vertices of a directed graph in which every vertex can reach every other vertex. Finding strongly connected components is a common application of DepthFirstSearch.

[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 strongly connected component is a maximal subset of the vertices of a directed graph in which every vertex can reach every other vertex. Finding strongly connected components is a common application of DepthFirstSearch.

2014-06-17 11:58