connectivity

In computer science, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed graph, if t is reachable from s.
Formally, the decision problem is given by

PATH = {⟨D, s, t⟩ | D is a directed graph with a path from vertex s to t}.

View More On Wikipedia.org