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

crate::ix!();

impl<GH> ConstructSingleNodeMucs for Graph<GH> 

where GH
: GetConnectedComponentSizes
+ ExtendWith<GH>
+ GetEdges
+ GetNeighborsForNode
+ GetNodeIdRange
+ HasMapForNode
+ InsertEdge
+ InsertNode
+ MappedNodes
+ NumEdges
+ NumNodes

{

    fn maybe_construct_single_node_muc(&mut self, idx: NodeId) {

        if self.nodes_to_mucs.mucid_for_node(idx) == MinimumUnionCycleId::inf() {

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

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

            muc.insert_node(idx);

            self.nodes_to_mucs.set_mucid_for_node(
                idx, 
                muc.id()
            );

            self.mucs.push(muc);
        }
    }

    fn construct_single_node_mucs(&mut self) {

        debug!("constructing single node MinimumUnionCycles...");

        // print_mucs();
        //
        // create single vertex muc's
        //
        for idx in NodeIdRange::new(0,self.nodes_to_mucs.len()) {

            self.maybe_construct_single_node_muc(idx);
        }
    }
}