Struct SignedGraph 

pub struct SignedGraph {
    pub n_nodes: usize,
    pub edges: Vec<SignedEdge>,
    pub pos_adj: Vec<Vec<usize>>,
    pub neg_adj: Vec<Vec<usize>>,
}

A signed (undirected) graph with separate positive and negative adjacency lists.

Fields

n_nodes: usize

Number of nodes.

edges: Vec<SignedEdge>

All edges.

pos_adj: Vec<Vec<usize>>

Positive adjacency list: pos_adj[i] = list of (neighbor, weight=+1.0).

neg_adj: Vec<Vec<usize>>

Negative adjacency list: neg_adj[i] = list of (neighbor, weight=+1.0).

Implementations

impl SignedGraph

pub fn new(n_nodes: usize) -> Self

Create an empty signed graph with n_nodes nodes.

pub fn add_edge(&mut self, src: usize, dst: usize, sign: i8)

Add a signed edge (undirected: both directions are recorded).

pub fn positive_edge_count(&self) -> usize

Return the number of positive edges.

pub fn negative_edge_count(&self) -> usize

Return the number of negative edges.

pub fn abs_degree(&self, v: usize) -> usize

Degree of node v in the absolute-value adjacency (all edges regardless of sign).

Trait Implementations

impl Clone for SignedGraph

fn clone(&self) -> SignedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SignedGraph

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

Formats the value using the given formatter.