bn:02198141n
Noun Concept
Categories: Directed graphs, Graph connectivity, NL-complete problems
EN
st-connectivity  Directed reachability  GAP  graph accessibility problem  st-non-connectivity
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia