Struct BiconnectedComponents 

pub struct BiconnectedComponents {
    pub count: usize,
    pub tree_edges: Vec<Vec<EdgeId>>,
    pub component_edges: Vec<Vec<EdgeId>>,
    pub components: Vec<Vec<VertexId>>,
    pub articulation_points: Vec<VertexId>,
}

The biconnected components of a graph, see Graph::biconnected_components.

All the lists are indexed by component id, in 0..count.

Fields

count: usize

The number of biconnected components.

tree_edges: Vec<Vec<EdgeId>>

For each component, the edges of one of its spanning trees.

component_edges: Vec<Vec<EdgeId>>

For each component, all of its edges. Every non-loop edge of the graph belongs to exactly one component.

components: Vec<Vec<VertexId>>

For each component, its vertices. A vertex may belong to several components (exactly when it is an articulation point) and isolated vertices belong to none.

articulation_points: Vec<VertexId>

The articulation points (cut vertices) of the graph.

Trait Implementations

impl Clone for BiconnectedComponents

fn clone(&self) -> BiconnectedComponents

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BiconnectedComponents

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

Formats the value using the given formatter.

impl Eq for BiconnectedComponents

impl PartialEq for BiconnectedComponents

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