In a di-graph when each strongly connected coomponent is


In a di-graph ,when each strongly connected coomponent is reduced to a single node,then the resulting di-graph is a directed acyclic diagraph. Explain why this is the case.

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: In a di-graph when each strongly connected coomponent is
Reference No:- TGS02478143

Now Priced at $10 (50% Discount)

Recommended (91%)

Rated (4.3/5)