Connectivity
Test and measure how well connected a graph is.
| Algorithm | What it does |
|---|---|
Minimum number of edges whose removal disconnects the graph. |
|
Test whether two specific vertices are connected by a path. Uses bidirectional BFS for early termination. |
| For connected components (grouping all vertices by reachability), see Connected Components. Edge connectivity measures the "strength" of the connection between the most weakly connected pair. |