all graphs which are not strongly connected can be broken down into strongly connected graphssince we can do this recursively, isn't this a tautology ??All notes