This is the documentation for the current state of the development branch of rustworkx. The documentation or APIs here can change prior to being released.


biconnected_components(graph, /)#

Return the biconnected components of an undirected graph.

Biconnected components are maximal subgraphs such that the removal of a node (and all edges incident on that node) will not disconnect the subgraph. Note that nodes may be part of more than one biconnected component. Those nodes are articulation points, or cut vertices. The algorithm computes how many biconnected components are in the graph, and assigning each component an integer label.


The function implicitly assumes that there are no parallel edges or self loops. It may produce incorrect/unexpected results if the input graph has self loops or parallel edges.


PyGraph – The undirected graph to be used.


A dictionary with keys the edge endpoints and value the biconnected component number that the edge belongs.

Return type: