# Find connected components in an undirected graph

in an undirected graph Given a graph $G = (V,E)$ how can we find a mapping from its vertices $V$ to the connected components of $G$.