Content deleted Content added
Line 19:
:Kosaraju's algorithm performs two depth first searches, but is very simple: the first search is used only to order the vertices, in the reverse of a [[postorder]] depth-first traversal. Then, the second pass of the algorithm loops through the vertices in this order, and for each vertex that has not already been assigned to a component, it performs a depth-first search of the [[transpose graph]] starting from that vertex, backtracking when the search reaches a previously assigned vertices; the unsassigned vertices reached by this search form a new component.
That actually gives a ''better'' description of the algorithm than the text currently in the article.[[Special:Contributions/130.243.83.63|130.243.83.63]] ([[User talk:130.243.83.63|talk]]) 15:58, 26 November 2015 (UTC)
| |||