thumb|300px|There is a path (graph theory)|path directed from "s" to "t" in the first graph, but not in the second.
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.
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).