Let G=(V, E) be a directed graph. Answer the following questions with the new one to the Strongly Connected Components (SCCs) of g.
1. What is an upper bound on the number of SCCs of G in the terms of the n?
2. Suppose that the an edge e=(u, v) is added to g. What is an upper bound on the change in the number of SCCs of G?
3. Suppose now that the an edge e=(u, v) in G is does the from g. What is an upper bound on the change in the number of SCCs of G?
4. Find a directed gragh G 'that has the same SCCs as that of G but G' has the further possible number of edges. In other words, the SCCs of G and G ' 'have the same set of are. You may describe the structure of G' to start with the Design an algorithm to the output to a G "' and also mention the run time of your algorithm. The Is G 'always a subgraph of G' '?

CodePudding user response:

What a great god can help solve, online, etc.,