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

crate::ix!();

impl<GH> ConstructMucsForConnectedComponent<GH> for Graph<GH> 

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

    fn maybe_construct_mucs_for_connected_component(
        &mut self, 
        component: GH)
    {
        if component.num_nodes() >= 3 {
            self.construct_mucs_for_connected_component(component);
        }
    }

    fn construct_mucs_for_connected_component(
        &mut self,
        component: GH)
    {
        let mut muc = MinimumUnionCycle::<GH>::default();

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

        muc.set_muc_subgraph(component);

        for nodeid in muc.mapped_nodes() {

            self.nodes_to_mucs.set_mucid_for_node(
                nodeid, 
                muc.id()
            );
        }

        self.mucs.push(muc);
    }
}