Struct ConnectedComponents 

pub struct ConnectedComponents {
    pub membership: Vec<VertexId>,
    pub sizes: Vec<usize>,
    pub count: usize,
}

The connected components of a graph, see Graph::connected_components.

Fields

membership: Vec<VertexId>

membership[v] is the id (in 0..count) of the component of vertex v.

sizes: Vec<usize>

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

count: usize

The number of components.

Implementations

impl ConnectedComponents

pub fn members(&self, c: usize) -> Vec<VertexId>

The vertices of component c, in increasing id order (empty if c is out of range).

pub fn groups(&self) -> Vec<Vec<VertexId>>

All the components as vertex lists, indexed by component id.

pub fn largest(&self) -> Option<usize>

Id of a largest (“giant”) component, the first one on ties; None for the null graph.

pub fn same_component(&self, u: VertexId, v: VertexId) -> bool

Whether vertices u and v lie in the same component (false for out-of-range ids).

Trait Implementations

impl Clone for ConnectedComponents

fn clone(&self) -> ConnectedComponents

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ConnectedComponents

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

Formats the value using the given formatter.

impl Eq for ConnectedComponents

impl PartialEq for ConnectedComponents

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