THE.ROCKSTAR's blog

how to convert a directed graph into a DAG( directed acyclic graph ) ?
By THE.ROCKSTAR, history, 38 hours ago, In English

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

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
37 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Maybe this helps — https://cp-algorithms.com/graph/strongly-connected-components.html

→ Reply
»
37 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

This is called Strongly Connected Components (SCC).

You can check some resources: USACO Guide, CP-Algorithms

→ Reply