ST-connectivity
= ST-connectivity
{c}
{wiki}
The directed graph reachability problem asks whether a directed graph contains a directed path from a specified vertex $s$ to a specified vertex $t$. It is NL-complete.
= Directed graph reachability problem
{synonym}