Connected Component (graph Theory)

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:

    A peasant becomes fond of his pig and is glad to salt away its pork. What is significant, and is so difficult for the urban stranger to understand, is that the two statements are connected by an and and not by a but.
    John Berger (b. 1926)

    ... 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)