Editing Distance matrix (section)

{{Short description|Square matrix containing the distances between elements in a set}}
{{more citations needed|date=February 2017}}
In [[mathematics]], [[computer science]] and especially [[graph theory]], a '''distance matrix''' is a [[square matrix]] (two-dimensional array) containing the [[distance]]s, taken pairwise, between the elements of a set.<ref>Weyenberg, G., & Yoshida, R. (2015). Reconstructing the phylogeny: Computational methods. In Algebraic and Discrete Mathematical methods for modern Biology (pp. 293–319). Academic Press.</ref> Depending upon the application involved, the ''distance'' being used to define this matrix may or may not be a [[metric (mathematics)|metric]]. If there are {{mvar|N}} elements, this matrix will have size {{math|''N''&times;''N''}}. In graph-theoretic applications, the elements are more often referred to as points, nodes or vertices.