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

crate::ix!();

impl<GH> InitBetweennessCentrality for Graph<GH> 
where GH: GetLimitedNodeIdRange,
      Self: GetLimitedNodeIdRange
{
    fn init_bc(&mut self) 
    -> Result<(),BetweennessCentralityError>  
    {
        if !self.bc_computed {

            self.scores = brandes_bc(self,None)?;

            for id in NodeIdRange::new(0,self.scores.len()) {

                let score = self.scores.score_for_node(id);

                self.scores.set_score_for_node(id, score);
            }

            self.bc_computed = true;
        }

        Ok(())
    }
}