For the graph , and vertices and , a walk from to is a finite alternating sequence of adjacent vertices and edges of .

The length of a walk is the number of edges in a walk.

Walks that start and end at different vertices are called open walks.

Walks that start and end at the same vertex are called closed walks.


repeats edgeswalk (маршрут)closed walk (затворен маршрут)
repeated verticestrail (верига)closed trail / curcuit (затворена верига)
no repeated edges / verticespath (път)cycle (цикъл)