icentral-alg 0.1.0

A Rust crate for incremental and parallel betweenness centrality algorithms.
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
51
52
53
54
55
56
57
58
59
60
61

crate::ix!();

pub fn maybe_do_paper_exp_inc_qube<GH>(
    brandes_time_vec: &Vec<Duration>,
    edge_vec2:        &Vec<Vec<Edge>>,
    num_iter:         Option<usize>,
    max_time:         Duration,
    path_vec:         &Vec<String>,
    do_qube:          bool) 
-> Result<(),BetweennessCentralityError> 
where 
Graph<GH>
    : GetLimitedNodeIdRange 
    + MappedNodes,
GH
    : ClearMucs
    + CreateNamedEmpty
    + HasMapForNode
    + Debug
    + InsertNode
    + MappedNodes
    + BccGraphHashInterface
    + InsertEdgeUpdateMuc
    + RemoveBridges
    + NewFromGraphRef<Graph<GH>>
    + GetNeighborsForNode
    + NewFromCycleVec
    + FindConnectedComponents<GH,Error=BetweennessCentralityError>
    + GetNodeIdRange
    + IsValid
    + GetConnectedComponentSizes
    + ExtendWith<GH,Error=BetweennessCentralityError>
{
    if do_qube {

        info!("Starting QUBE");

        for i in 0..path_vec.len() {

            let mut graph = Graph::from_filename(&path_vec[i]);

            let brandes_time = brandes_time_vec[i];

            let mut loc_num_iter: Option<usize> = num_iter;

            if num_iter.is_some() && brandes_time < max_time {
                loc_num_iter = None;
            }

            exp_qube_p(
                &mut graph,
                loc_num_iter, 
                &edge_vec2[i], 
                brandes_time
            );
        }
    }

    Ok(())
}