refers to a problem in computer science
and computational complexity theory
, a decision problem
asking if two vertices s
in a directed graph
connected by a path
The algorithm is in the complexity class co-NL, and hence in the class NL, by the Immerman-Szelepcsényi Theorem.