Reachability

In graph theory, reachability is the ability 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.

Read more about Reachability:  Definition, DAGs and Partial Orders, Algorithms, Node Failures, See Also