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

This may be helpful: An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.