icentral-test-basic-icentral 0.1.0

Provides foundational utilities for basic testing within the iCentral framework in Rust 2021 edition.
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106

crate::ix!();

pub const USE_ERDOS: bool = false;

#[test] fn test_basic_icentral() -> Result<(), BetweennessCentralityError> {

    setup_test_logger![];
    
    let start = Instant::now();

    tracing::info!("Testing [iCentral] ... ");

    let e: Edge = Edge::new_with_ids(3,7);

    let mut graph: Graph = match USE_ERDOS {
        true  => Graph::from_filename("icentral/Erdos02.lcc.net"),
        false => Graph::from(GraphMock::Paper),
    };

    debug!("graph: {:#?}", graph);

    // fill_test_graph(graph);
    let mut scores = fast_brandes_bc(&graph)?;

    info!("scores: {:?}", scores);

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

    info!("component: {:#?}", component);

    let mut delta_bc_of_vertices = BetweennessScores::new(
        component.num_nodes(), 
        "test_basic_icentral::delta_bc_of_vertices"
    );

    let num_threads = 1;

    icentral(
        num_threads, 
        &mut delta_bc_of_vertices, 
        arcmut![component], 
        e, 
        None
    );

    info!("delta_bc_of_vertices: {:?}",delta_bc_of_vertices);

    for node in delta_bc_of_vertices.nodeid_range() {

        scores.increase_score_for_node(
            node, 
            delta_bc_of_vertices.score_for_node(node)
        );
    }

    info!("scores: {:?}", scores);

    let mut mismatches = vec![];

    debug!("if we insert this edge, it looks like we get mismatches...");

    //graph.insert_edge(&e);

    let ref_scores = brandes_bc(&mut graph, None)?;

    info!("ref_scores: {:?}", ref_scores);

    info!("checking for mismatches");

    for node in scores.nodeid_range() {

        let diff = (scores.score_for_node(node) - ref_scores.score_for_node(node)).abs();

        if diff > EPS.into() {

            mismatches.push(diff);
        }

        // debug!("[%f]  [%f]", scores.score_for_node(&v), ref_scores.score_for_node(&v));
    }

    for item in mismatches.iter() {

        warn!("data mismatch! diff={}", item);
    }

    if mismatches.len() > 0 {

        warn!("got {} mismatches!", mismatches.len());

        return Err(
            BCError::DataMismatches { mismatches }
        );
    }

    info!("no mismatches -- success!");

    let elapsed = Instant::now() - start;

    info!("elapsed: {:?}", elapsed);

    Ok(())
}