0
$\begingroup$

While reading corman book, i just came across examples to find strongly connected components in a directed graph. But it turns out be disjoint union of cycles. Is this true for all directed graphs?

What about biconnected components? are they also disjoint union of cycles? please correct me if am thinking wrongly

$\endgroup$
  • $\begingroup$ Try writing a few examples and see if you can find a counterexample... $\endgroup$ – D.W. Dec 13 '19 at 22:19
  • $\begingroup$ Sir from examples only I saw this observation. Can u please point to some links at least? $\endgroup$ – Nascimento de Cos Dec 15 '19 at 16:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.