 Path in a graph

A path of length $t$ is a sequence of $t+1$ distinct vertices in which consecutive vertices are adjacent.

Any walk between distinct endpoints contains a simple path between those endpoints, obtained by removing segments between repeated vertices.