The Shortest Path Problem for the Distant Graph of the Projective Line Over the Ring of Integers

The distant graph G = G ( P ( Z ) , △ ) of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein’s geometric interpretation of Euclidean continued fractions. In case the minimal path is non-unique, all the possible splitting are described which allows us to give necessary and sufficient conditions for existence of a unique shortest path.