Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:alsoKnownAs |
Connected Component
|
| gptkbp:appliesTo |
gptkb:Undirected_Graph
Directed Graph |
| gptkbp:countedBy |
Number of connected components in a graph
|
| gptkbp:defines |
A maximal connected subgraph of a graph
|
| gptkbp:example |
In a disconnected graph, each isolated subgraph is a component
|
| gptkbp:field |
gptkb:Graph_Theory
|
| gptkbp:hasWikipediaPage |
https://en.wikipedia.org/wiki/Component_(graph_theory)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Component (Graph Theory)
|
| gptkbp:property |
No vertex in a component is connected to any vertex outside the component
Every vertex in a component is reachable from every other vertex in the same component |
| gptkbp:relatedConcept |
Strongly Connected Component
Weakly Connected Component |
| gptkbp:supportsAlgorithm |
gptkb:Breadth-First_Search
gptkb:Depth-First_Search |
| gptkbp:usedIn |
gptkb:Mathematics
gptkb:Network_Analysis Computer Science Social Network Analysis |
| gptkbp:bfsParent |
gptkb:Connected_Undirected_Graph
|
| gptkbp:bfsLayer |
7
|