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

crate::ix!();

impl<GH> FindMucs for Graph<GH> 

where GH
: GetEdges
+ ClearMucs
+ CreateNamedEmpty
+ Debug
+ BccGraphHashInterface
+ ExtendWith<GH,Error=BetweennessCentralityError>
+ FindConnectedComponents<GH,Error=BetweennessCentralityError>
+ GetConnectedComponentSizes
+ GetNeighborsForNode
+ GetNodeIdRange
+ HasMapForNode
+ InsertEdge
+ InsertNode
+ IsValid
+ MappedNodes
+ NewFromCycleVec
+ NewFromGraphRef<Self>
+ NumEdges
+ NumNodes
+ RemoveBridges
{
    /// 1. find bridges
    ///
    /// 2. delete bridges
    ///
    /// 3. find connected components of size >=3
    /// (these are MinimumUnionCycles)
    ///
    fn find_mucs_fast(&mut self) 
    -> Result<(),BetweennessCentralityError> 
    {
        let mut bridge_vec: Vec<Edge> = self.find_bridge_edges::<GH>();

        let mut gh: GH = GH::new_from_graph_ref(&*self, name![self.name(),"find_mucs_fast::gh"]);

        gh.remove_bridges(bridge_vec);

        let mut conn_comp_vec: Vec<GH> = gh.find_conn_comp()?;

        self.construct_mucs(conn_comp_vec);

        self.construct_single_node_mucs();

        self.find_conn_verts();

        self.find_all_muc_subgraphs();

        debug!("DONE");

        Ok(())
    }

    fn find_mucs(&mut self)  {
        
        //find_muc_mcb();
        self.find_mucs_fast();
    }
}