icentral-graph 0.1.0

A Rust library for advanced graph manipulation, focusing on minimum union cycles, betweenness centrality, and biconnected components.
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

crate::ix!();

impl<GH> CreateAndPushNewMuc for Graph<GH> 

where GH
: ExtendWith<GH,Error=BetweennessCentralityError> 
+ GetConnectedComponentSizes 
+ GetEdges
+ GetNeighborsForNode
+ GetNodeIdRange
+ HasMapForNode
+ InsertEdge
+ InsertNode
+ MappedNodes
+ NumEdges
+ NumNodes
{
    type Error = BetweennessCentralityError;

    fn create_and_push_new_muc(
        &mut self, 
        shortest_path: &Vec<NodeId>,
        edge:          &Edge, 
        src_muc_id:    MinimumUnionCycleId,
        dst_muc_id:    MinimumUnionCycleId)
    -> Result<MinimumUnionCycleId,Self::Error>
    {
        debug!("we will create and push a new MUC");

        let mut new_muc: MinimumUnionCycle<GH> = default!();

        new_muc.set_id(self.mucs.len());

        merge_mucs(
            &mut self.nodes_to_mucs,
            &mut new_muc, 
            &mut self.mucs[dst_muc_id.val()]
        );

        merge_mucs(
            &mut self.nodes_to_mucs,
            &mut new_muc, 
            &mut self.mucs[src_muc_id.val()]
        );

        for &node in shortest_path.iter() {

            let node_muc_id: MinimumUnionCycleId = self.nodes_to_mucs.mucid_for_node(node);

            if node_muc_id != new_muc.id() {

                merge_mucs(
                    &mut self.nodes_to_mucs,
                    &mut new_muc, 
                    &mut self.mucs[node_muc_id.val()]
                );
            }
        }

        new_muc.insert_edge(&edge);

        let id = new_muc.id();

        // cout << endl << endl;
        // new_muc.muc_subgraph.print_graph();
        //
        self.mucs.push(new_muc);

        Ok(id)
    }
}