Struct CardinalitySearch 

pub struct CardinalitySearch {
    pub alpha: Vec<i64>,
    pub alpham1: Vec<VertexId>,
}

Result of Graph::maximum_cardinality_search.

Fields

alpha: Vec<i64>

alpha[v] is the rank of vertex v, in 0..n; visiting vertices by decreasing rank always picks the vertex with most visited neighbors.

alpham1: Vec<VertexId>

The inverse permutation of alpha: alpham1[r] is the vertex of rank r, i.e. the vertices in reverse maximum cardinality search order.

Trait Implementations

impl Clone for CardinalitySearch

fn clone(&self) -> CardinalitySearch

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CardinalitySearch

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

Formats the value using the given formatter.

impl PartialEq for CardinalitySearch

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