Given a graph, a pat=
h is a sequence of distinct nodes *(N*_{1},N_{2},...,N_{k}) w=
here each pair of consecutive nodes is connected by an edge, i.e., *N*_{1} is connected to <=
em>N_{2}, *N*_{2} is connected to *N*_{3}, etc. In this example, the path is said to *connect* *N=
*_{1} to *N*_{k}.

**In other languages**

DE: Weg

FR: chemin

IT: percorso

TR, =
KH, VM

------=_Part_52016_1587662787.1660961201836--