biconnectedComponents
biconnectedComponents(graph) decomposes an undirected graph into edge-biconnected components using a low-link traversal. It accepts an adjacency list or Graph<N, W>.
| Signature | Returns | Complexity |
|---|---|---|
biconnectedComponents(graph: usize[][]) | [usize, usize][][] | O(V + E) |
biconnectedComponents(graph: Graph<N, W>) | [usize, usize][][] | O(V + E) |
Each inner array contains the edges of one component as vertex pairs. Bridges form singleton components, while edges on the same cycle belong together.
Example
tyrus
import { biconnectedComponents } from "tyrus:algorithm";
const components: [usize, usize][][] = biconnectedComponents([[1, 2], [0, 2, 3], [0, 1], [1]]);
print(components.length); // 2Study result
biconnectedComponentsInfo returns BiconnectedComponentsInfo, with copied components and shared low-link metrics.
tyrus
interface BiconnectedComponentsInfo {
examinedEdgeCount: usize;
discoveryIndices: usize[];
lowLinks: usize[];
resultCount: usize;
components: [usize, usize][][];
}tyrus
import { BiconnectedComponentsInfo, ConnectivityInfo, biconnectedComponentsInfo } from "tyrus:algorithm";
const info: BiconnectedComponentsInfo = biconnectedComponentsInfo([[1, 2], [0, 2, 3], [0, 1], [1]]);
print(info.components); // [[ [1, 3] ], [ [2, 0], [1, 2], [0, 1] ]]
print(info.examinedEdgeCount); // 8
print(info.discoveryIndices); // [0, 1, 2, 3]
print(info.lowLinks); // [0, 0, 0, 3]
print(info.resultCount); // 2