In a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$, two nodes $u$ and $v$ are strongly connected if and only if they are mutually reachable i.e. there is a path from u to $v$ and a path from $v$ to $u$.
A strongly connected component (SCC) of a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$ is a maximal set of vertices such that any two vertices in the set are strongly connected(mutually reachable).
On adding one extra edge (an edge which previously did not exist in the graph) to a directed graph $\mathrm{G}$, the number of strongly connected components $\dots?$
- can not increase
- can not decrease by more than $1$
- can not decrease by more than $2$
- may remain unchanged