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