Struct Components 

pub struct Components { /* private fields */ }

Which component each node is in.

What counts as a component is the algorithm’s business. wcc() fills this in with the weakly connected ones, where an edge joins its two ends whichever way it points, and scc() with the strongly connected ones, where two nodes are together only if each can be reached from the other. The shape of the answer is the same either way, and so is the rule about the label.

Implementations

impl Components

pub fn of(&self, node: u32) -> u32

The component node is in, named by the lowest numbered node in it.

Panics

If node is not a node of the snapshot this was computed from.

pub fn same(&self, a: u32, b: u32) -> bool

Whether two nodes are in the same component.

pub fn count(&self) -> u32

How many components there are, counting an isolated node as its own.

pub fn len(&self) -> u32

How many nodes were labelled.

pub fn is_empty(&self) -> bool

Whether there were no nodes at all.

pub fn largest(&self) -> Option<(u32, u32)>

The component with the most nodes in it, and how many that is.

None for a graph with no nodes. The lowest numbered of them when two are the same size, so the answer does not depend on iteration order.

pub fn labels(&self) -> &[u32]

The label of every node, in dense id order.

Trait Implementations

impl Clone for Components

fn clone(&self) -> Components

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Components

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

Formats the value using the given formatter.