Просмотр кода страницы 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>u</math> and <math>v</math> is
the minimum length of a path from <math>u</math> to <math>v</math>. The path of minimum
length is called a '''shortest path''' between <math>u</math> and <math>v</math>.