Struct RcGraph 

pub struct RcGraph { /* private fields */ }

A directed graph where nodes are reference-counted.

Implementations

impl RcGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_node(&mut self, data: u64) -> u32

Add a node with the given data.

pub fn add_edge(&mut self, src: u32, dst: u32)

Add a directed edge from src to dst.

pub fn remove_edge(&mut self, src: u32, dst: u32) -> bool

Remove an edge and decrement destination refcount.

pub fn node_data(&self, id: u32) -> Option<u64>

Get node data.

pub fn refcount(&self, id: u32) -> u32

Get refcount.

pub fn out_edges(&self, id: u32) -> Vec<u32>

Get out-edges.

pub fn remove_node(&mut self, id: u32)

Remove a node (and all edges from it).

pub fn node_count(&self) -> usize

Number of nodes.

pub fn edge_count(&self) -> usize

Number of edges.

pub fn zero_refcount_nodes(&self) -> Vec<u32>

Nodes with zero refcount (potential garbage).

Trait Implementations

impl Default for RcGraph

fn default() -> Self

Returns the “default value” for a type.