Module connectivity 

Graph connectivity algorithms

This module contains algorithms for analyzing graph connectivity properties including connected components, articulation points, bridges, and bipartite checking.

Structs

BipartiteResult

Result of bipartite checking

Functions

articulation_points

Finds all articulation points (cut vertices) in an undirected graph

bridges

Finds all bridges (cut edges) in an undirected graph

connected_components

Finds all connected components in an undirected graph

is_bipartite

Checks if a graph is bipartite and returns the coloring if it is

strongly_connected_components

Finds all strongly connected components in a directed graph using Tarjan’s algorithm

weakly_connected_components

Finds all weakly connected components in a directed graph

Type Aliases

Component

Each connected component is represented as a set of nodes