Skip to content

findCutVertices ​

findCutVertices(graph) returns vertices whose removal disconnects an undirected graph. It accepts an adjacency list or Graph<N, W>.

SignatureReturnsComplexity
findCutVertices(graph: usize[][])usize[]O(V + E)
findCutVertices(graph: Graph<N, W>)usize[]O(V + E)

The adjacency list is interpreted as undirected and should contain symmetric entries. Each result appears once, even when it separates multiple subgraphs.

Example ​

tyrus
import { findCutVertices } from "tyrus:algorithm";

const cuts: usize[] = findCutVertices([[1, 2], [0, 2, 3], [0, 1], [1]]);
print(cuts.length); // 1

Study result ​

findCutVerticesInfo returns FindCutVerticesInfo, with copied cut vertices and shared low-link metrics.

tyrus
interface FindCutVerticesInfo {
    examinedEdgeCount: usize;
    discoveryIndices: usize[];
    lowLinks: usize[];
    resultCount: usize;
    cutVertices: usize[];
}
tyrus
import { ConnectivityInfo, FindCutVerticesInfo, findCutVerticesInfo } from "tyrus:algorithm";
const info: FindCutVerticesInfo = findCutVerticesInfo([[1, 2], [0, 2, 3], [0, 1], [1]]);
print(info.cutVertices); // [1]
print(info.examinedEdgeCount); // 8
print(info.discoveryIndices); // [0, 1, 2, 3]
print(info.lowLinks); // [0, 0, 0, 3]
print(info.resultCount); // 1