Find a method↗
To determine if a directed graph is strongly connected, you must verify that every pair of vertices is mutually reachable. If you find even one pair of vertices where one cannot reach the other, the graph is not strongly connected.
Conditions: The graph is directed.; You need to check mutual reachability for all vertex pairs.
2:23 – 3:14Watch this moment ↗
To determine if a directed graph is strongly connected, you must verify that every pair of vertices is mutually reachable. If you find even one pair of vertices where one cannot reach the other, the graph is not strongly connected.
Conditions: The graph is directed.; You need to check mutual reachability for all vertex pairs.
2:23 – 3:14Watch this moment ↗