Strongly connected component
Partition of a graph whose components are reachable from all vertices
Strongly connected component
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of a directed graph form a partition into subgraphs that are strongly connected themselves. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time (that is, Θ(V + E)).
Read on Wikipedia · Image Д.Ильин: vectorization, CC0
Open boosters, collect cards and trade them. Free to play.
Play for free