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> InsertEdge for Graph<GH> {

    fn insert_edge(&mut self, edge: &Edge) 
    -> Result<(),BetweennessCentralityError> 
    {
        debug!("in {}, inserting edge {} into graph", self.name(), edge);

        if self.edges.has_edge(&edge) {
            return Ok(());
        }

        let rev = edge.reversed();

        if self.edges.has_edge(&rev) {
            return Ok(());
        }

        self.edges.insert_edge(rev);

        self.nodes_map.add_edge(edge);

        Ok(())
    }
}