Direct acyclic graph to strongly connected graph


My program has to calculate what is the minimum number of edges to add to make a strongly connected graph from a direct acyclic graph (dag).

Is it difficult? What is the correct algorithm?

Thank you in advance.


  • Would it just be one for each leaf? I figure you could turn a tree into a strongly connected graph by having each leaf point back to the root of the tree. Somebody please correct me if I am mistaken.
Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


In this Discussion