Struct PlanarSeparator 

pub struct PlanarSeparator { /* private fields */ }

Planar separator solver over an undirected graph.

Implementations

impl PlanarSeparator

pub fn new(n: usize) -> Self

Create an edgeless solver on n vertices.

pub fn add_edge(&mut self, u: usize, v: usize) -> GraphalgResult<()>

Add an undirected edge (u, v). Self-loops are ignored; parallel edges are de-duplicated.

pub fn from_adjacency_list(g: &AdjacencyList) -> GraphalgResult<Self>

Build a planar separator solver from an AdjacencyList, symmetrising the edges (the graph is treated as undirected).

pub fn num_nodes(&self) -> usize

Number of vertices.

pub fn separate(&self) -> GraphalgResult<SeparatorResult>

Compute a balanced vertex separator.

Trait Implementations

impl Clone for PlanarSeparator

fn clone(&self) -> PlanarSeparator

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PlanarSeparator

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

Formats the value using the given formatter.