test_partial_digest, a Fortran90 code which can generate example cases of the partial digest problem.
In the partial digest problem, we assume that there are N objects arranged along a line. We denote the position of object I by X(I). The positions of the objects are unknown. Instead, we have a list of the distances between every distinct pair of objects. Note that the distances are not "tagged"; that is, if there is a 175 on the list of distances, we don't know which two objects are separated by that distance. In the partial digest problem, we start with the (N*(N-1))/2 distances D, and must come up with at least one linear arrangement of N objects that corresponds to the distances.
To use this library, the user specifies a number of objects N, and a maximum separation DMAX. The library will generate N object locations in an array called LOCATE, and the corresponding list of distances D.
The information on this web page is distributed under the MIT license.
test_partial_digest is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
cities, a Fortran90 code which carries out various computations involving the locations or relative distances of cities on a map.
cities, a dataset directory which defines the locations or relative distances of cities on a map.
combo, a Fortran90 code which carries out various combinatorial computations.
distance_to_position, a Fortran90 code which estimates the positions of cities based on a city-to-city distance table.
partial_digest, a Fortran90 code which seeks solutions of the partial digest problem.
subset, a Fortran90 code which carries out various combinatorial computations.