Length of a path

Length of a path --- длина пути.

In an unweighted graph, the length of a path is the number of arcs in the path. In a weighted graph, the length of a path is the sum of the weights of all edges of the path. The shortest-path distance between [math]\displaystyle{ u }[/math] and [math]\displaystyle{ v }[/math] is the minimum length of a path from [math]\displaystyle{ u }[/math] to [math]\displaystyle{ v }[/math]. The path of minimum length is called a shortest path between [math]\displaystyle{ u }[/math] and [math]\displaystyle{ v }[/math].