Connected Component (graph Theory)
In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph. For example, the graph shown in the illustration on the right has three connected components. A graph that is itself connected has exactly one connected component, consisting of the whole graph.
Read more about Connected Component (graph Theory): An Equivalence Relation, The Number of Connected Components, Algorithms
Famous quotes containing the words connected and/or component:
“We can’t nourish our children if we don’t nourish ourselves.... Parents who manage to stay married, sane, and connected to each other share one basic characteristic: The ability to protect even small amounts of time together no matter what else is going on in their lives.”
—Ron Taffel (20th century)
“... no one knows anything about a strike until he has seen it break down into its component parts of human beings.”
—Mary Heaton Vorse (1874–1966)