ΠΌΠ°Ρ€ΡˆΡ€ΡƒΡ‚

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.

Types

properties
repeats edgeswalk (ΠΌΠ°Ρ€ΡˆΡ€ΡƒΡ‚)closed walk (Π·Π°Ρ‚Π²ΠΎΡ€Π΅Π½ ΠΌΠ°Ρ€ΡˆΡ€ΡƒΡ‚)
repeated verticestrail (Π²Π΅Ρ€ΠΈΠ³Π°)closed trail / curcuit (Π·Π°Ρ‚Π²ΠΎΡ€Π΅Π½Π° Π²Π΅Ρ€ΠΈΠ³Π°)
no repeated edges / verticespath (ΠΏΡŠΡ‚)cycle (Ρ†ΠΈΠΊΡŠΠ»)