DAG to Strong-Connected Graph

[bogdan]

Hello everyone!

Here is my problem: I have a directed acyclic graph and I want a good way to find out how many and what are the edges I have to add for creating a strong-connected graph.

Thank you in advance!