Definition: A vertex v is reachable from another vertex u if there is a path of any length from u to v.

See also sink, source, connected graph.

Note: Usually applied only to directed graphs, since any vertex in a connected, undirected graph is reachable from any other vertex.

Author: JM

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Jason McCabe, "reachable", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: