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:
“Before I had my first child, I never really looked forward in anticipation to the future. As I watched my son grow and learn, I began to imagine the world this generation of children would live in. I thought of the children they would have, and of their children. I felt connected to life both before my time and beyond it. Children are our link to future generations that we will never see.”
—Louise Hart (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)