st-connectivity
Sign in to saveAlso known as STCON, graph accessibility problem, GAP
thumb|300px|There is a path (graph theory)|path directed from "s" to "t" in the first graph, but not in the second.
~3 min read
Encyclopedic overview
2 sectionsContents
- Complexity
- References
thumb|300px|There is a path (graph theory)|path directed from "s" to "t" in the first graph, but not in the second.
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.
Excerpted from Wikipedia’s “st-connectivity” article, available under the CC BY-SA 4.0 licence.