GraphLab › Connectedness and components
A graph is connected when every vertex can be reached from every other vertex. A graph that is not connected falls apart into connected components.
A strong component is a largest group of vertices that can all reach each other.
Step through the weak components and then the strong components. Each vertex is labelled with the root of its component, and the last step names the type of connectedness.