High Quality Content by WIKIPEDIA articles! In mathematics, a distance matrix is a matrix (two-dimensional array) containing the distances, taken pairwise, of a set of points. It is therefore a symmetric NxN matrix containing non-negative reals as elements, given N points in Euclidean space. The number of pairs of points Nx(N-1)/2 is the number of independent elements in the distance matrix. Distance matrices are related to adjacency matrices, with the differences that (a) the latter only provides the information which vertices are connected but does not tell about costs or distances between the vertices and (b) an entry of a distance matrix is smaller if two elements are closer, while "close" (connected) vertices yield larger entries in an adjacency matrix.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.