Revision as of 06:12, 30 May 2020 edit 2a02:2f08:e70e:5400:fd4c:61bb:1c5b:44f5 (talk) →Bookkeeping ← Previous edit		Revision as of 14:43, 30 May 2020 edit undo 2a02:2f08:e70e:5400:acf8:7683:51ae:e2fa (talk) →Overview Next edit →
Line 14: == Overview == Ce face Sabinuta? The algorithm takes a [[directed graph]] as input, and produces a [[Partition of a set\|partition]] of the graph's [[Vertex (graph theory)\|vertices]] into the graph's strongly connected components. Each vertex of the graph appears in exactly one of the strongly connected components. Any vertex that is not on a directed cycle forms a strongly connected component all by itself: for example, a vertex whose in-degree or out-degree is 0, or any vertex of an acyclic graph.

Tarjan's strongly connected components algorithm: Difference between revisions