# Strongly connected (directed graphs)
Last edited: 2026-01-28
Strongly connected
Let $G = (V, E)$ be a directed graph . We say that two vertices $x, y \in V$ are strongly connected if there exist paths from $x$ to $y$ and from $y$ to $x$.
Last edited: 2026-01-28
Let $G = (V, E)$ be a directed graph . We say that two vertices $x, y \in V$ are strongly connected if there exist paths from $x$ to $y$ and from $y$ to $x$.