  In this paper we provide a method of finding possible numbers of shortest
paths between two points in a space of compact sets in Euclidean space with
Hausdorff distance. We also prove that there cannot be some of the numbers of
shortest paths, thus expanding previous works [1][2]
