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?