Editing Strongly connected component (section)

==Related results==
A directed graph is strongly connected if and only if it has an [[ear decomposition]], a partition of the edges into a sequence of directed paths and cycles such that the first subgraph in the sequence is a cycle, and each subsequent subgraph is either a cycle sharing one vertex with previous subgraphs, or a path sharing its two endpoints with previous subgraphs.

According to [[Robbins' theorem]], an undirected graph may be [[graph orientation|oriented]] in such a way that it becomes strongly connected, if and only if it is [[k-edge-connected graph|2-edge-connected]]. One way to prove this result is to find an ear decomposition of the underlying undirected graph and then orient each ear consistently.<ref>{{citation
 | last = Robbins | first = H. E. | author-link = Herbert Robbins
 | journal = [[American Mathematical Monthly]]
 | jstor = 2303897
 | pages = 281–283
 | title = A theorem on graphs, with an application to a problem on traffic control
 | volume = 46
 | issue = 5 | year = 1939
 | doi=10.2307/2303897 }}.</ref>