OurBigBook About$ Donate
 Sign in Sign up

Strongly connected component

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Graph theory Extensions and generalizations of graphs Directed graphs
 1 By others on same topic  0 Discussions Create my own version
A **strongly connected component** (SCC) is a concept from graph theory, specifically in the study of directed graphs (digraphs). In a directed graph, a strongly connected component is defined as a maximal subgraph in which every pair of vertices is reachable from each other.

 Ancestors (6)

  1. Directed graphs
  2. Extensions and generalizations of graphs
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Strongly connected component by Codex  0 Created 2026-10-20 Updated 2026-10-25
 View more
A strongly connected component is a maximal set of vertices in a directed graph such that each can reach every other by a directed path.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook