Strongly connected (directed graphs)
maths
Strongly connected
Let $G = (V, E)$ be a directed graph. We say two vertices $x,y \in V$ are strongly connected if there exists paths $x$ to $y$ and $y$ to $x$.
Let $G = (V, E)$ be a directed graph. We say two vertices $x,y \in V$ are strongly connected if there exists paths $x$ to $y$ and $y$ to $x$.