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

crate::ix!();

impl<GH> ReadGraph for Graph<GH> 
where GH: BccGraphHashInterface
{
    type Error = BetweennessCentralityError;

    /*
     | #vertices    #edges
     | src1         dst1
     | .
     | .
     | src#edges    dst#edges
     */
    fn read_graph(&mut self, path: &str) 
    -> Result<(),Self::Error>  
    {
        debug!("reading graph from filename: {}", path);

        let fin = File::open(path)?;

        let mut bytes = fin.bytes().map(|ch| ch.unwrap());

        let n: usize = read!("{} ",bytes);
        let m: usize = read!("{}",bytes);

        self.init_size(n);

        for i in 0..m {

            let src: usize = read!("{} ",bytes);
            let dst: usize = read!("{}",bytes);

            self.insert_edge(&Edge::new_with_ids(src,dst))?;
        }

        self.init_internals()?;

        debug!("finished reading graph from file:\n{:#?}", self);

        Ok(())
    }
}