E. Cyclic Components – Competitive Programming – Test Case Failed – DFS/GRAPHS + DSU
You are given an undirected graph consisting of ????
vertices and ????
edges. Your task is to find the number of connected components which are cycles.
You are given an undirected graph consisting of ????
vertices and ????
edges. Your task is to find the number of connected components which are cycles.