Concepts inRemark on algorithm 562: shortest path lengths
Horse length
A horse length, or simply length, is a unit of measurement that refers to the length of a horse from nose to tail, approximately 8 feet, It is commonly used in Thoroughbred horse racing, where it describes the distance between horses in a race. Horses may be described as winning by several lengths, as in the notable example of Secretariat, who won the Belmont Stakes by 31 lengths (248 feet) More often winning distances are merely a fraction of a length, such as half a length.
more from Wikipedia
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map; in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment.
more from Wikipedia
Algorithm
In mathematics and computer science, an algorithm Listen/ˈælɡərɪðəm/ (originating from al-Khwārizmī, the famous mathematician Muḥammad ibn Mūsā al-Khwārizmī) is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning. More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
more from Wikipedia