Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03541976n
Noun Concept
Categories: Directed graphs, Graph connectivity
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
Subgraph. Wiktionary (translation)
IS A
directed graph
component
STUDIED BY
graph theory
Wikipedia
EN
strongly connected component
Wikidata
EN
strongly connected component
Wiktionary
EN
strongly connected component
Wikipedia Redirections
EN
condensation (graph), SCC (graph theory), Strongly-connected component, Strongly-connected components, strongly connected, strongly connected components, strongly connected graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License