PineWikiA 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.
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.
StronglyConnectedComponents (last edited 2007-12-25 23:42:18 by localhost)