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}.
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}.
Source: Wikipedia "St-connectivity" · CC BY-SA 4.0
Share this article: X · Bluesky