Exactly what the title says. Can a graph have the same number of strongly connected components and weakly connected components?
I am using networkX and have the same number for a dataset for both weakly and strongly connected components.
I believe that it can but I was wondering if it means anything for a graph to have this coincidence.
It means that every weakly connected component is strongly connected. This implies the digraph is the union of disjoint strongly connected digraphs.
Mathematically, there's no problems with this: there's plenty of digraphs where this occurs, such as the union of directed cycles.
It might have some significance from a network science perspective. (Or it could be some artifact: e.g. NetworkX may have interpreted an undirected graph as a digraph with edges directed in both directions.)