= Component (graph theory)
{wiki=Component_(graph_theory)}
In graph theory, a **component** (or connected component) of a graph refers to a maximal subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph. In simpler terms, it is a subset of the graph in which there is a path between every pair of vertices, and any vertex not included in this subset cannot be reached from any vertex in the subset.
Back to article page