Struct DistanceMatrix 

pub struct DistanceMatrix { /* private fields */ }

Symmetric dissimilarity matrix. No metric assumptions: entries need not satisfy the triangle inequality. Entries must be non-negative and not NaN; +inf is legal and equivalent to an absent edge.

The matrix has two storage forms. The compact form holds the condensed lower triangle, n(n-1)/2 entries, and is the form every constructor builds. The full form holds both triangles row-major, n * n entries, so that a cofacet diameter fold reads one contiguous row per simplex vertex instead of one strided column.

Implementations

impl DistanceMatrix

pub fn from_points(points: &[Vec<f64>]) -> Result<Self>

Euclidean distances of a point cloud. Coordinates must be finite.

pub fn from_condensed(condensed: Vec<f64>) -> Result<Self>

Build from the condensed lower triangle, row by row: d(1,0), d(2,0), d(2,1), d(3,0), and so on. An empty vector means one point (n = 1). Only DistanceMatrix::from_points can build an empty space (n = 0).

impl DistanceMatrix

pub fn len(&self) -> usize

Number of points.

pub fn is_empty(&self) -> bool

True when there are no points.

pub fn get(&self, i: usize, j: usize) -> f64

Distance between points i and j (0 on the diagonal).

pub fn enclosing_radius(&self) -> f64

Default threshold: the minimum over i of the maximum over j of d(i, j). Past that radius the complex is a cone and acquires no further homology.

Trait Implementations

impl Clone for DistanceMatrix

fn clone(&self) -> DistanceMatrix

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DistanceMatrix

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.