Content deleted Content added
m Reverted 1 edit by 2A02:2F08:E70E:5400:ACF8:7683:51AE:E2FA (talk) to last revision by 2A02:2F08:E70E:5400:FD4C:61BB:1C5B:44F5 (TW) |
|||
Line 14:
== Overview ==
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.
| |||