Struct VoronoiPartition 

pub struct VoronoiPartition {
    pub membership: Vec<Option<u32>>,
    pub distances: Vec<f64>,
}

Result of voronoi: the Voronoi cell each vertex belongs to plus the distance to its assigned generator.

membership[v] is the index into generators of the generator vertex that v was assigned to (so generators[membership[v] .unwrap()] is the vertex id of that generator). None means v is unreachable from every generator. distances[v] is the shortest-path distance from v to its generator (under the given mode), or f64::INFINITY if unreachable.

Fields

membership: Vec<Option<u32>>

Per-vertex generator index; None for unreachable vertices.

distances: Vec<f64>

Per-vertex distance to assigned generator; f64::INFINITY if unreachable. Unweighted graphs round to integer values.

Trait Implementations

impl Clone for VoronoiPartition

fn clone(&self) -> VoronoiPartition

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VoronoiPartition

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

Formats the value using the given formatter.

impl PartialEq for VoronoiPartition

fn eq(&self, other: &VoronoiPartition) -> 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 StructuralPartialEq for VoronoiPartition