icentral-parallel-brandes 0.1.0

Efficient parallel computation of betweenness centrality using Brandes' algorithm in large graphs, leveraging Rust's concurrency model.
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!();

/**
  | Parallel Brandes functions
  | 
  | Ziyad territory
  |
  */
pub fn parallel_brandes<G>(
    graph:  &G,
    scores: &mut BetweennessScores

) -> Result<(),BetweennessCentralityError> 

where G
: NumNodes 
+ MappedNodes 
+ GetNodeIdRange 
+ GetNeighborsForNode 
+ GetEdges
{

    // 1. make a component (fill a subgraph)
    // 2. loop through all sources
    let num_nodes = graph.num_nodes();

    scores.reinit(num_nodes);

    let mut component: Component = Component::new_from_graph_ref(
        graph, 
        "parallel_brandes::component"
    );

    // we want to do brandes_iter from each node
    // in the graph each thread will be
    // responsible for doing brandes_iter from
    // a subset of the nodes in the graph
    //
    // 1. divide the nodes in the graph to vectors,
    //   each has a subset of nodes a thread is
    //   responsible for
    //
    // 2. call brandes_block to get the
    //   contribution of the thread's nodes to the
    //   final BC value (fork and join)
    //
    // 3. accumulate the results in scores

    Ok(())
}