Struct BitPackedGraph 

pub struct BitPackedGraph { /* private fields */ }

Bit-packed representation for unweighted graphs

Uses 1 bit per potential edge, extremely memory efficient for unweighted graphs.

Implementations

impl BitPackedGraph

pub fn new(n_nodes: usize, directed: bool) -> Self

Create a new bit-packed graph

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

Add an edge

pub fn has_edge(&self, from: usize, to: usize) -> bool

Check if edge exists

pub fn neighbors(&self, node: usize) -> Vec<usize>

Get neighbors of a node (optimized with SIMD-like operations)

pub fn degree(&self, node: usize) -> usize

Get degree of a node efficiently

pub fn memory_usage(&self) -> usize

Memory usage in bytes

Trait Implementations

impl Clone for BitPackedGraph

fn clone(&self) -> BitPackedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BitPackedGraph

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

Formats the value using the given formatter.