Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Strongly connected component
open-in-new
<p>In the <a href="/facts/Mathematics/pxTouaz4">mathematical</a> theory of <a href="/facts/Directed_graph/YBdfQ0um">directed graphs</a>, a graph is said to be strongly connected if every vertex is <a href="/facts/Reachability/D8cQpSFQ">reachable</a> from every other vertex. The strongly connected components of a directed graph form a <a href="/facts/Partition_of_a_set/VeP9g8CA">partition</a> into <a href="/facts/Subgraph_(graph_theory)/W0MqKkyE">subgraphs</a> that are themselves strongly connected. It is possible to test the strong <a href="/facts/Connectivity_(graph_theory)/FSNjsYhz">connectivity</a> of a graph, or to find its strongly connected components, in <a href="/facts/Linear_time/77T62gmf">linear time</a> (that is, Θ(<i>V</i> + <i>E</i> )). </p>