Meet the concept↗
A strongly connected graph is a directed graph in which every pair of vertices is mutually reachable. This means that for any two vertices u and v, there is a directed path from u to v and a directed path from v to u.
Conditions: The graph is directed.; The criterion requires mutual reachability between every pair of vertices.
1:23 – 2:23Watch this moment ↗
A strongly connected graph is a directed graph in which every pair of vertices is mutually reachable. This means that for any two vertices u and v, there is a directed path from u to v and a directed path from v to u.
Conditions: The graph is directed.; The criterion requires mutual reachability between every pair of vertices.
1:23 – 2:23Watch this moment ↗