Definition:Finite Path
From ProofWiki
Definition
Let $G$ be a graph.
A finite path in $G$ is a path consisting of a finite number of edges.
Note that equivalently, as the vertices are distinct (apart from perhaps the first and last) in a path, it follows that a finite path also has a finite number of vertices.