Minimal paths

Faarfoshan series on paper, New York, USA, 2016

Minimal path is the set of edges which when traversed cover the least amount of distance between two edges.

Minimal distance is the sum of the distance between the edges of a minimal path.

But what happen when the edges are duplicated or not at the right position?