I have a little bit knowledge about graph. We know that strong Connectivity applies to directed graphs. Is it possible strong Connectivity applies to un-directed graphs? Please explain.
Strong Connectivity means that you can go from every node to every other node. In a un-directed graph, for this thing to happen, you only need to check whether from one node u can reach every node. So, for an un-directed graph, we just say a connected graph and not strongly-connected
Tnq @mathecodician. Can we say a un-directed graph is weakly connected?