Graph/articulation_points library

🧩 Articulation Points (Cut Vertices)

Finds articulation points in an undirected graph using DFS discovery times and low-link values (Tarjan-style). A node is an articulation point if:

  • It is the root of DFS and has more than one child, or

  • It is not a root and has a child v with lowv >= discu.

  • Time complexity: O(V + E)

  • Space complexity: O(V)

Functions

articulationPoints<T>(Map<T, List<T>> graph) → Set<T>