(definition)
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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:06 2006.
Cite this as:
Jason McCabe, "reachable", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/reachable.html