Struct Subgraph 

pub struct Subgraph { /* private fields */ }

A self-contained subgraph composed of a subset of nodes and the edges that connect them internally.

Implementations

impl Subgraph

pub fn new(label: impl Into<String>) -> Self

Create an empty subgraph with a label.

pub fn add_node(&mut self, node_idx: usize)

Add a node (by its parent-graph index) to the subgraph.

pub fn add_internal_edge( &mut self, from: usize, to: usize, ) -> Result<(), String>

Add an internal edge. Both endpoints must already be in the subgraph; returns an error string otherwise.

pub fn node_count(&self) -> usize

Number of nodes in the subgraph.

pub fn edge_count(&self) -> usize

Number of internal edges.

pub fn contains_node(&self, node_idx: usize) -> bool

Returns true if node_idx is part of this subgraph.

pub fn label(&self) -> &str

Label of the subgraph.

pub fn internal_edges(&self) -> &[(usize, usize)]

Slice of all internal edges.

pub fn boundary(&self, all_edges: &[(usize, usize)]) -> SubgraphBoundary

Compute the boundary of this subgraph given the full parent-graph edge list all_edges.

An input boundary node is a node outside the subgraph that has an edge pointing into a subgraph node.

An output boundary node is a node inside the subgraph that has an edge pointing outside the subgraph.

Trait Implementations

impl Clone for Subgraph

fn clone(&self) -> Subgraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Subgraph

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

Formats the value using the given formatter.