In 1962 Ore initiated the study of geodetic graphs. A graph is called geodetic if the shortest path between every pair of vertices is unique. In the subsequent years a wide range of papers appeared investigating their peculiar properties. Yet, a complete classification of geodetic graphs is out of reach. In this work we present a program enumerating all geodetic graphs of a given size. Using our program, we succeed to find all geodetic graphs with up to 25 vertices and all regular geodetic graphs with up to 32 vertices. This leads to the discovery of two new infinite families of geodetic graphs.

翻译：1962年，Ore开创了对大地测量图的研究。若图中每对顶点之间的最短路径唯一，则称该图为大地测量图。随后的数年间，涌现了大量研究其特殊性质的论文。然而，对大地测量图进行完整分类仍遥不可及。本文提出一种枚举给定规模下所有大地测量图的程序。利用该程序，我们成功找到了所有顶点数不超过25的大地测量图，以及所有顶点数不超过32的正则大地测量图。由此发现了两类新的无限大地测量图族。