For questions about the st-connectivity problem in computer science.
The st-connectivity problem is the computational task in which the objective is to determine whether there is a path from one vertex to another in a given directed graph. The problem is known to be NL-complete. Informally, this means that st-connectivity is the "most difficult" problem solvable on a non-deterministic Turing machine using logarithmic amount of memory.