Struct BiconnectedComponents 

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

Output of biconnected_components.

Fields

count: u32

Total number of biconnected components.

components: Vec<Vec<VertexId>>

components[i] lists the vertex ids of the i-th component.

tree_edges: Vec<Vec<u32>>

tree_edges[i] lists the edge ids that form a spanning tree of the i-th component. Same length as components.

component_edges: Vec<Vec<u32>>

component_edges[i] lists every edge id whose endpoints both lie in the i-th component. Same length as components. Counterpart of upstream’s component_edges output (CC-012).

articulation_points: Vec<VertexId>

Articulation points of the graph (in DFS-discovery order).

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 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 Eq for BiconnectedComponents

impl StructuralPartialEq for BiconnectedComponents