I am working with an undirected graph and need to determine the number of connected components that are also cycles. A cycle is defined as a connected component where each vertex has exactly two edges, and the component contains at least three vertices.

I am working with an undirected graph and need to determine the number of connected components that are also cycles. A cycle is defined as a connected component where each vertex has exactly two edges, and the component contains at least three vertices.

I am working with an undirected graph and need to determine the number of connected components that are also cycles. A cycle is defined as a connected component where each vertex has exactly two edges, and the component contains at least three vertices.

I have a directed graph that I want to find a spanning tree. I read here that Steiner tree will not work on directed graph.
If it’s hard to approximate what would be another algorithm that will work on directed, unweighted graph?