icentral-rbfs 0.1.0

A Rust crate for calculating and updating betweenness centrality scores in graphs using Recursive Breit-First Search strategies, optimized for dynamic and static networks.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

crate::ix!();


#[derive(Debug)]
pub enum RbfsOperation {
    Addition,
    Subtraction,
}

pub fn rbfs(
    delta_bc_of_vertices:    &mut BetweennessScores,

    // component could be BiconnectedComponents,
    // MinimumUnionCycle, or just a graph
    component:               &mut Component,
    source_of_the_iteration: NodeId,
    workspace:               &mut ICentralWorkspace,
    op:                      Option<RbfsOperation>) 

-> Result<(),BetweennessCentralityError> 
{
    debug!("running rbfs from source={}", source_of_the_iteration);

    let len = component.num_nodes();

    workspace.deltas_fill_to_len(len, 0.0);

    match component.ty() {

        CompType::Graph => rbfs_graph(
            delta_bc_of_vertices,
            source_of_the_iteration,
            workspace,
            &op,
        )?,

        CompType::BiconnectedComponent => rbfs_bcc(
            delta_bc_of_vertices,
            component,
            source_of_the_iteration,
            workspace,
            &op,
        )?,
        _ => { 
            unreachable!();
        }
    }

    Ok(())
}