how to convert a directed graph into a DAG( directed acyclic graph ) ?

Правка en2, от THE.ROCKSTAR, 2025-01-06 05:04:58

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 .... ;)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский THE.ROCKSTAR 2025-01-06 05:04:58 2 Tiny change: 'graph)? \nAre ther' -> 'graph)? \n\nAre ther'
en1 Английский THE.ROCKSTAR 2025-01-06 05:04:28 279 Initial revision (published)