GraphLab

Graph theory & algorithm visualizer
About Connectedness and components

GraphLab › Connectedness and components

Connected Components: Strongly, Unilaterally and Weakly Connected Graphs

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.

Directed graphs

A strong component is a largest group of vertices that can all reach each other.

Try it in GraphLab

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.

More topics