Open ghost opened 2 years ago
there's a paper describing an algorithm based on johnsons to find simple cycles up to a bounded length: https://arxiv.org/pdf/2105.10094.pdf
Gupta, Anshul, and Toyotaro Suzumura. "Finding All Bounded-Length Simple Cycles in a Directed Graph." arXiv preprint arXiv:2105.10094 (2021).
is it easy to adapt this source code to implement that algorithM?
I am having the same question. Did you found the answer?
there's a paper describing an algorithm based on johnsons to find simple cycles up to a bounded length: https://arxiv.org/pdf/2105.10094.pdf
Gupta, Anshul, and Toyotaro Suzumura. "Finding All Bounded-Length Simple Cycles in a Directed Graph." arXiv preprint arXiv:2105.10094 (2021).
is it easy to adapt this source code to implement that algorithM?