[−][src]Struct pointcloud::utils::AdjMatrix

pub struct AdjMatrix { /* fields omitted */ }

The data structure for an adjacency matrix. This is a simple wrapper around a hash-map whose keys are pairs of PointIndexes and whose values are the distances between the two points. This is usually the method one want to access the data.

It assumes your data is symmetric and only stores the upper triangular matrix

Methods

impl AdjMatrix[src]

pub fn get(&self, i: PointIndex, j: PointIndex) -> Option<&f32>[src]

This gets by passing the smaller of the two indexes as the first element of the pair and the larger as the second.

pub fn min(&self) -> f32[src]

Iterates over all distances and gets the minimum.

Trait Implementations

impl Debug for AdjMatrix[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T, U> Cast<U> for T where
    U: FromCast<T>, [src]

impl<T> From<T> for T[src]

impl<T> FromCast<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.