Struct DynamicGraph 

pub struct DynamicGraph { /* private fields */ }

Mutable directed graph with incremental add/remove and a reverse index.

Implementations

impl DynamicGraph

pub fn new(n: usize) -> Self

Create an edgeless dynamic graph on n vertices.

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

Build a dynamic graph from a static AdjacencyList (directed).

Parallel edges in the source list increment the multiplicity.

pub fn num_nodes(&self) -> usize

Number of vertices.

pub fn num_distinct_edges(&self) -> usize

Number of distinct directed edges (ignoring multiplicity).

pub fn num_edges(&self) -> usize

Total number of directed edges counting multiplicity.

pub fn out_neighbors(&self, u: usize) -> GraphalgResult<&[usize]>

Out-neighbours of u (distinct, unsorted).

pub fn in_neighbors(&self, u: usize) -> GraphalgResult<&[usize]>

In-neighbours of u (distinct, unsorted).

pub fn out_degree(&self, u: usize) -> GraphalgResult<usize>

Out-degree of u counting multiplicity.

pub fn edge_multiplicity(&self, u: usize, v: usize) -> u32

Multiplicity of the ordered pair (u, v) (zero if absent).

pub fn has_edge(&self, u: usize, v: usize) -> bool

Whether the directed edge u -> v is present.

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

Insert a directed edge u -> v, incrementing multiplicity.

Returns true if this introduced a new distinct edge (the pair was not previously present), false if it only bumped an existing multiplicity.

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

Remove one unit of multiplicity from the directed edge u -> v.

Returns true if the distinct edge was fully removed (multiplicity hit zero), false if it merely decremented. Errors with GraphalgError::NoSolution when the edge is absent.

pub fn to_adjacency_list(&self) -> AdjacencyList

Materialise the current state as a static AdjacencyList, expanding each pair to its multiplicity (so parallel edges reappear).

Trait Implementations

impl Clone for DynamicGraph

fn clone(&self) -> DynamicGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DynamicGraph

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

Formats the value using the given formatter.