Kosarajus Algorithm

CodeChefOpen on judge ↗

Given an undirected graph with V vertices and an adjacency list adj, find all the articulation points (cut vertices). An articulation point is defined as a vertex whose removal (along with all edges connected to it) would increase the number of connected components in the graph. The graph may be initially disconnected. There might be self-loops present in the graph. Return the vertices in asce

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI