(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 Thu Jul 29 09:49:06 2004.
HTML page formatted Wed Oct 26 09:48:09 2005.
Cite this as:
Paul E. Black, "simple path", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/simplepath.html