(definition)

**Definition:**
A list of *vertices* of a *graph* where each vertex has an *edge* from it to the next vertex.

**Specialization** (... is a kind of me.)

*simple path*, *shortest path*, *cycle*, *Hamiltonian cycle*, *Euler cycle*, *alternating path*.

**See also**
*all pairs shortest path*, *all simple paths*.

*Note:
A path is usually assumed to be a simple path, unless otherwise defined.*

Author: PEB

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 29 July 2004.

HTML page formatted Mon Nov 18 10:44:10 2013.

Cite this as:

Paul E. Black, "path", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 29 July 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/path.html