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:
“War and culture, those are the two poles of Europe, her heaven and hell, her glory and shame, and they cannot be separated from one another. When one comes to an end, the other will end also and one cannot end without the other. The fact that no war has broken out in Europe for fifty years is connected in some mysterious way with the fact that for fifty years no new Picasso has appeared either.”
—Milan Kundera (b. 1929)
“... 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)