How can a directed graph be converted into a DAG (directed acyclic graph)?

Are there any standard algorithms or resources I can refer to ?

currently solving a cses problem , in which i needed this .... ;)