In a directed graph with n≥2 nodes, if two different nodes reaches every nodes (including itself), then this graph is strongly connected.

51 Views Asked by At

I think this statement is true because if node a can reach every node (including node b) and node b can reach every node (including node a), there is an edge between node a and node b. This means that every nodes other than a and b can connect with each others via the node a and node b edge. But I am not sure about how to formalize the proof.

1

There are 1 best solutions below

0
On

Here is a simple counterexample:

 a <=====> b ----> c