Struct Graph 

pub struct Graph {
    pub cap_stats: EdgeCapStats,
    /* private fields */
}

Fields

cap_stats: EdgeCapStats

Implementations

impl Graph

pub fn new() -> Self

pub fn edge_category( &self, src: &FragmentId, dst: &FragmentId, ) -> Option<EdgeCategory>

pub fn for_each_categorized_edge<F: FnMut(&FragmentId, &FragmentId, EdgeCategory)>( &self, f: F, )

pub fn insert_edge_category( &mut self, src: FragmentId, dst: FragmentId, cat: EdgeCategory, )

pub fn categorized_edge_count(&self) -> usize

pub fn add_node(&mut self, node: FragmentId)

pub fn add_edge(&mut self, src: FragmentId, dst: FragmentId, weight: f64)

pub fn node_count(&self) -> usize

pub fn nodes(&self) -> impl Iterator<Item = &FragmentId>

pub fn edge_count(&self) -> usize

pub fn freeze(&mut self)

Convert the build-time hashmap representation into CSR and drop the hashmaps. After freeze, fwd/rev are empty and all reads go through CSR.

pub fn to_csr(&mut self) -> &(CsrGraph, CsrGraph)

pub fn fwd_csr(&self) -> Option<&CsrGraph>

pub fn rev_csr(&self) -> Option<&CsrGraph>

pub fn forward_edge_weight( &self, src: &FragmentId, dst: &FragmentId, ) -> Option<f64>

Look up the weight of edge src -> dst in the forward CSR.

pub fn for_each_forward_neighbor<F: FnMut(&FragmentId, f64)>( &self, node: &FragmentId, f: F, )

Invoke f(neighbor_id, weight) for each forward neighbor of node.

pub fn ego_graph( &self, seeds: &FxHashSet<FragmentId>, radius: usize, ) -> FxHashMap<FragmentId, f64>