Struct TransitiveClosure 

pub struct TransitiveClosure {
    pub n: usize,
    /* private fields */
}

Dense boolean reachability relation for an n-vertex digraph.

The matrix is stored row-major: entry (u, v) lives at index u * n + v.

Fields

n: usize

Number of vertices.

Implementations

impl TransitiveClosure

pub fn reachable(&self, u: usize, v: usize) -> GraphalgResult<bool>

Is v reachable from u? Returns GraphalgError::IndexOutOfBounds if either index is >= n.

pub fn matrix(&self) -> &[bool]

Borrow the underlying row-major reachability matrix (n * n bits).

pub fn is_reflexive(&self) -> bool

Whether this closure was built with the reflexive diagonal forced on.

Trait Implementations

impl Clone for TransitiveClosure

fn clone(&self) -> TransitiveClosure

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TransitiveClosure

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

Formats the value using the given formatter.

impl Eq for TransitiveClosure

impl PartialEq for TransitiveClosure

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