Enum VoronoiTiebreaker 

pub enum VoronoiTiebreaker {
    First,
    Last,
    Random,
}

Tie-breaking rule used when two or more generators reach a vertex at the same distance.

Mirrors igraph_voronoi_tiebreaker_t from references/igraph/include/igraph_paths.h.

Variants

First

Keep the earliest generator (in input order) that reached the vertex. Counterpart of IGRAPH_VORONOI_FIRST.

Last

Always overwrite with the latest generator. Counterpart of IGRAPH_VORONOI_LAST.

Random

Pick one of the equidistant generators uniformly at random. Counterpart of IGRAPH_VORONOI_RANDOM. Uses a seeded SplitMix64 so results are reproducible per seed value.

Note: as in the C reference, VoronoiTiebreaker::Random does not guarantee that the resulting partitions are connected subgraphs (a tie-breaker chain can leave a vertex behind in a disconnected island of its assigned partition).

Trait Implementations

impl Clone for VoronoiTiebreaker

fn clone(&self) -> VoronoiTiebreaker

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for VoronoiTiebreaker

impl Debug for VoronoiTiebreaker

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

Formats the value using the given formatter.

impl Eq for VoronoiTiebreaker

impl PartialEq for VoronoiTiebreaker

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