# Is there a name for metric spaces where the path for shortest distance is unique?

In normal Euclidean space with the $L_2$ metric, the shortest path between two points is a straight and unique line. However, on the taxi-cab metric ($L_1$), between any two points that do not lie on the same vertical or horizontal line, there are an infinite number of shortest paths between all with the same path distance.

Is there a name for and/or a way determine whether a given metric has unique shortest paths?

• Roughly, a space with paths of minimal length between pairs of points is a length [metric] space. If the paths are unique, I would suggest that the phrase unique length [metric] space is likely unambiguous. Mar 16 '18 at 15:53
• As to the question of finding paths of minimal length, that is a more difficult problem (while I was typing, Simonsays gave one example). For example, the Sierpinski gasket is a length space, but contains pairs of points for which there are two paths of minimal length, and others for which the path of minimal length is unique. It is not obvious (though true) that two is the maximum number of minimal paths. More pathological examples exist. Mar 16 '18 at 15:56

you might be interested in Riemannian manifolds $(M,d)$, which are manifolds that come along with a metric induced by $d$.