Definition: A list of vertices of a graph where each vertex has an edge between it and 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.
In a directed graph, each vertex has an edge from it to the next vertex.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 24 August 2017.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "path", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 24 August 2017. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/path.html