Struct Reachability 

pub struct Reachability {
    pub membership: Vec<VertexId>,
    pub sizes: Vec<usize>,
    pub count: usize,
    pub reach: Vec<Vec<bool>>,
}

Reachability information, see Graph::reachability.

Vertices in the same strongly connected component reach exactly the same vertices, so the reachable sets are stored once per component.

Fields

membership: Vec<VertexId>

membership[v] is the id of the (strongly, for directed graphs with Out/In modes) connected component of v.

sizes: Vec<usize>

sizes[c] is the number of vertices of component c.

count: usize

The number of components.

reach: Vec<Vec<bool>>

reach[c][v] is true when vertex v is reachable from the vertices of component c (every vertex reaches itself).

Implementations

impl Reachability

pub fn is_reachable(&self, from: VertexId, to: VertexId) -> bool

Whether to is reachable from from (false for out-of-range ids).

pub fn reachable_from(&self, from: VertexId) -> Vec<VertexId>

The vertices reachable from from, in increasing id order (empty for an out-of-range id).

Trait Implementations

impl Clone for Reachability

fn clone(&self) -> Reachability

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Reachability

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

Formats the value using the given formatter.

impl Eq for Reachability

impl PartialEq for Reachability

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