A maximal group of vertices in an undirected graph where every vertex can reach every other. A BFS or DFS from one vertex finds exactly its component.
Connected component
A maximal group of vertices in an undirected graph where every vertex can reach every other. A BFS or DFS from one vertex finds exactly its component.