Is there any module available in Erlang to find all the cycles of an undirected graph?

Question

For a directed graph, we have the following module:

digraph_utils:cyclic_strong_components(G)

Is there anything like this available for undirected graphs in Er