In graph theory, reachability is the notion of being able to get from one vertex in a directed graph to some other vertex. Note that reachability in undirected graphs is trivial--it is sufficient to find the connected components in the graph, which can be done in linear time
In graph theory, reachability is the notion of being able to get from one vertex in a directed graph to some other vertex