Strongly connected componentStrongly connected component
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
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.
Excerpt from the Wikipedia article “Strongly connected component”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Michel Bakni, CC BY-SA 4.0, via Wikimedia Commons.
Open free boosters and add Strongly connected component to your collection.
Play for free

