Hey,
given $G = (V,E)$ a directed Graph. Is there any way to calculate the maximum number of strongly connected components $k$, only based on $n$ nodes and $e$ edges?
Hey, given $G = (V,E)$ a directed Graph. Is there any way to calculate the maximum number of strongly connected components $k$, only based on $n$ nodes and $e$ edges? 

