Generate a DAG (Directed Acyclic Graph) starting from standard graph

Question

This is the scenario: I have a standard graph and the goal is finding the edges which, once deleted, generate a DAG. Can you give me a hint to reach this algorithm?
Sh