Graph Algorithms • Connectivity

Connected Components

Discover maximal sets of reachable vertices. This simulation partitions an undirected graph into disjoint clusters using BFS traversal.

Isolation

A connected component is a maximal subgraph where every pair of nodes has a path between them.

Pick an unvisited node, run BFS to find all reachable nodes, mark them as a component, and repeat.

The algorithm effectively divides the graph into independent groups. No edges exist between nodes of different components.

Used in image segmentation, social network analysis, and understanding the vulnerability of communication grids.

Loading Lab...

Graph Algorithms • Connectivity

Discover maximal sets of reachable vertices. This simulation partitions an undirected graph into disjoint clusters using BFS traversal.

A connected component is a maximal subgraph where every pair of nodes has a path between them.

Pick an unvisited node, run BFS to find all reachable nodes, mark them as a component, and repeat.

The algorithm effectively divides the graph into independent groups. No edges exist between nodes of different components.

Used in image segmentation, social network analysis, and understanding the vulnerability of communication grids.