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

crate::ix!();

impl<GH> RemoveEdge for Graph<GH> {

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

        let rev = edge.reversed();

        self.edges.remove_edge(&edge);
        self.edges.remove_edge(&rev);

        debug!("src nbrs {:#?}", self.nodes_map.neighbors(edge.src));
        debug!("dst nbrs {:#?}", self.nodes_map.neighbors(edge.dst));

        self.nodes_map.unlink_edge(edge);

        Ok(())
    }
}