Definition:Path (Graph Theory)

Definition
Let $G$ be an undirected graph.

A path in $G$ is a trail in $G$ in which all vertices (except perhaps the first and last ones) are distinct.

A path between two vertices $u$ and $v$ is called a $u$-$v$ path.

Path in Digraph
In the context of a directed graph the definition is similar:

Also see

 * Definition:Walk (Graph Theory)


 * Definition:Trail


 * Definition:Cycle (Graph Theory): a closed path: that is, a path in which the first and last vertices are the same.