add simple cycle enumeration by k shortest simple path algorithm

[kappybar]

Add another algorithm of enumearting simple cycles in digraph, which is based on k shortest simple path algorithm.

For each edge e=uv, delete e from the original graph and enumerate vu simple path in increasing length order by k shortest simple path algorithm to obtain simple cycles that contain e in increasing length order.

Using iterators for each edge e and priority queue makes it possible to enumerate simple cycles in increasing length order.

📝 Checklist

• The title is concise and informative.
• The description explains in detail what this PR is about.
• I have linked a relevant issue or discussion.
• I have created tests covering the changes.
• I have updated the documentation and checked the documentation preview.

⌛ Dependencies

#40114

[dcoudert]

I think that the algorithm is not what we want: If I understand well, with the current proposal, you start an iterator from each edge of the graph, so some cycles may be reported more than once.

The correct algorithm should be like:

1. take edge e=uv and remove it from G
2. use an kSSP iterator to enumerate all vu paths in G-uv, and so the cycles containing uv
3. decompose G-uv into strongly connected components and apply the same algorithm from step 1 on each SCC.

We now get a collection of iterators that you can put in a priority queue to enumerate the cycles in the right order.