spanningDag

An acyclic subgraph of the receiver, containing all vertices, and a locally maximal subset of the edges (i.e., no additional edge of the original graph can be added without making the resulting graph acyclic).

Multiple solutions are possible, depending on which edges are included first.