Also known as reachability relation
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex s can reach a vertex t (and t is reachable from s) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with s and ends with t.
Wikidata facts
- Instance of
- binary relation
Show 2 more facts
- studied by
- graph theory
- characteristic of
- node
Sources (2)
via Wikidata · CC0