(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 E. Black.

Entry modified 29 July 2004.

HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:

Paul E. Black, "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/path.html