How to remove cycles in an unweighted directed graph, such that the number of edges is maximised?

Question

Let G be an unweighted directed graph containing cycles. I\'m looking for an algorithm which finds/creates all acyclic graphs G\', composed of all vertices in G and a subset of

Answer 1

If your goal is to remove cycle edges (breaking cycles) while preserving graph hierarchies (structures) as much as possible, this work maybe helpful: https://github.com/zhenv5/breaking_cycles_in_noisy_hierarchies