bn:03541976n
Noun Concept
Categories: Graph connectivity, Directed graphs
EN
strongly connected component  condensation  SCC  Strongly-connected component  Strongly-connected components
EN
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. Wikipedia
Given a directed graph, a maximal strongly connected subgraph. Wiktionary