(definition)
Definition: A path that repeats no vertex.
See also Hamiltonian path, cycle, enumerate all simple paths between two vertices.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 29 July 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "simple path", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 29 July 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/simplepath.html
