path
sequence of edges connecting a sequence of vertices in a graph, with no repeating vertices
Hamiltonian path
path in a graph that visits each vertex exactly once
directed path
sequence of correctly oriented edges in a directed graph, with no repeating vertices
self-avoiding walk
a sequence of moves on a lattice that does not visit the same point more than once
induced path
graph path which is an induced subgraph
random path
a path in a network or graph with random course