In graph theory, a component, sometimes called 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 has three components. A vertex with no incident edges is itself a component. A graph that is itself connected has exactly one component, consisting of the whole graph.
An alternative way to define components involves the equivalence classes of an equivalence relation that is defined on the vertices of the graph. In an undirected graph, a vertex v is reachable from a vertex u if there is a path from u to v. In this definition, a single vertex is counted as a path of length zero, and the same vertex may occur more than once within a path. Reachability is an equivalence relation, since:
It is reflexive: There is a trivial path of length zero from any vertex to itself.
It is symmetric: If there is a path from u to v, the same edges form a path from v to u.
It is transitive: If there is a path from u to v and a path from v to w, the two paths may be concatenated together to form a path from u to w.
The components are then the induced subgraphs formed by the equivalence classes of this relation.
It is straightforward to compute the components of a graph in linear time using either breadth-first search or depth-first search. In either case, a search that begins at some particular vertex v will find the entire component containing v before returning. To find all the components of a graph, loop through its vertices, starting a new breadth first or depth first search whenever the loop reaches a vertex that has not already been included in a previously found component. describe essentially this algorithm, and state that at that point it was "well known". There are also efficient algorithms to dynamically track the components of a graph as vertices and edges are added, as a straightforward application of disjoint-set data structures. These algorithms require amortized O time per operation, where adding vertices and edges and determining the component in which a vertex falls are both operations, and α is a very slow-growing inverse of the very quickly growing Ackermann function. A related problem is tracking components as all edges are deleted from a graph, one by one; an algorithm exists to solve this with constant time per query, and O time to maintain the data structure; this is an amortized cost of O per edge deletion. For forests, the cost can be reduced to O, or O amortized cost per edge deletion. Researchers have also studied algorithms for finding components in more limited models of computation, such as programs in which the working memory is limited to a logarithmic number of bits. asked whether it is possible to test in logspace whether two vertices belong to the same component of an undirected graph, and defined a complexity classSL of problems logspace-equivalent to connectivity. Finally succeeded in finding an algorithm for solving this connectivity problem in logarithmic space, showing that L = SL.
In random graphs the sizes of components are given by a random variable, which, in turn, depends on the specific model. The model has three regions with seemingly different behavior: Subcritical : All components are simple and very small, the largest component has size ; Critical : ; Supercritical : where is the positive solution to the equation where and are respectively the largest and the second largest components. All other components have their sizes of the order
