[FEA] Support for simple_cycles

[beckernick]

Describe the solution you'd like and any additional context

I'd like to be able to use simple_cycles like I can with NetworkX.

import networkx as nx
​
edges = [(0, 0), (0, 1), (0, 2), (1, 2), (2, 0), (2, 1), (2, 2)]
G = nx.DiGraph(edges)
sorted(nx.simple_cycles(G))
[[0], [0, 1, 2], [0, 2], [1, 2], [2]]

---

For Developers below this line

• [] Code passes CI
• [] Code uses Graph Primitives
• [] Code in C++/CUDA layer
• [] Code in C layer
• [] Code in pylibcugraph Python layer
• [] Code in cugraph Python layer
• [] Documentation
• [] Test cases at each layer (for MG tests, a note in the PR description indicating the new/existing MG tests were run and passed)

[github-actions[bot]]

This issue has been labeled inactive-30d due to no recent activity in the past 30 days. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed. This issue will be labeled inactive-90d if there is no activity in the next 60 days.

[acostadon]

We currently do not support that functionality but it is on our to-do list. Unfortunately it will not be until mid/late next year.

[ChuckHastings]

@eriknw - do we support this in nx-cugraph? Is there work we would need to accelerate in cugraph core?