Question: 13. Consider all directed graphs with k strongly connected components. If you add one edge to such graphs, what is the minimum number of strongly

13. Consider all directed graphs with k strongly connected components. If you add one edge to such graphs, what is the minimum number of strongly connected components that (at least) one of the graphs can attain? 1 2. k-2 k-1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
