distance_matrix(x, y, p=2, threshold=1000000)

Returns the matrix of all pair-wise distances.

Parameters

x : (M, K) array_like

Matrix of M vectors in K dimensions.

y : (N, K) array_like

Matrix of N vectors in K dimensions.

p : float, 1 <= p <= infinity

Which Minkowski p-norm to use.

threshold : positive int

If M * N * K > threshold , algorithm uses a Python loop instead of large temporary arrays.

Returns

result : (M, N) ndarray

Matrix containing the distance from every vector in x to every vector in y.

Compute the distance matrix.

Examples

>>> from scipy.spatial import distance_matrix
... distance_matrix([[0,0],[0,1]], [[1,0],[1,1]])
array([[ 1.        ,  1.41421356],
       [ 1.41421356,  1.        ]])

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.spatial._kdtree.KDTree.sparse_distance_matrix scipy.spatial._kdtree.distance_matrix

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/spatial/_kdtree.py#876
type: <class 'function'>
Commit: