Struct NeighborGraph 

pub struct NeighborGraph {
    pub num_nodes: usize,
    pub edges: Vec<[u32; 2]>,
}

A directed neighborhood graph over a point cloud.

Fields

num_nodes: usize

Number of nodes (input points).

edges: Vec<[u32; 2]>

Directed edges as [source, target] index pairs (no self-loops).

Implementations

impl NeighborGraph

pub fn num_edges(&self) -> usize

Number of directed edges.

pub fn is_empty(&self) -> bool

Whether the graph has no edges.

Trait Implementations

impl Clone for NeighborGraph

fn clone(&self) -> NeighborGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NeighborGraph

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

Formats the value using the given formatter.

impl PartialEq for NeighborGraph

fn eq(&self, other: &NeighborGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for NeighborGraph

impl StructuralPartialEq for NeighborGraph