Question: Let G be a directed, unweighted graph with exactly k strongly connected components. If a single directed edge is added to G ( where there

Let G be a directed, unweighted graph with exactly k strongly connected components. If a single directed edge is added to G (where there was not already an edge), which of the following is possible?
There may be more than one possibility.
1. The number of strongly connected components increases
2. The number of strongly connected components decreases
3. The number of strongly connected components stays the same
Justify your answer.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!