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:
“Religious fervor makes the devil a very real personage, and anything awe-inspiring or not easily understood is usually connected with him. Perhaps this explains why, not only in the Ozarks but all over the State, his name crops up so frequently.”
—Administration in the State of Miss, U.S. public relief program (1935-1943)
“... 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)