*маршрут*

For the graph **walk** from

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*.

## Types

properties | ||
---|---|---|

repeats edges | walk (маршрут) | closed walk (затворен маршрут) |

repeated vertices | trail (верига) | closed trail / curcuit (затворена верига) |

no repeated edges / vertices | path (път) | cycle (цикъл) |