shortest path
RU: кратчайший путь
The path from a source to a target with the smallest total length: the fewest edges in an unweighted graph, or the smallest sum of edge weights in a weighted one.
RU: кратчайший путь
The path from a source to a target with the smallest total length: the fewest edges in an unweighted graph, or the smallest sum of edge weights in a weighted one.