icentral_graph/
find_conn_verts.rs

1crate::ix!();
2
3impl<GH> FindConnVerts for Graph<GH> 
4where GH
5: GetEdges
6+ ClearMucs
7+ ExtendWith<GH>
8+ GetConnectedComponentSizes
9+ GetNeighborsForNode
10+ GetNodeIdRange
11+ HasMapForNode
12+ InsertEdge
13+ InsertNode
14+ IsValid
15+ MappedNodes
16+ NumEdges
17+ NumNodes
18{
19    /// find the connection vertices for each muc
20    ///
21    /// edges that belong to the graph and don't
22    /// belong to any muc connect two connection
23    /// vertices
24    ///
25    /// 1. collect all edges in mucs in one set
26    ///
27    /// 2. do simple subtraction of edges and
28    ///    update muc's
29    ///
30    fn find_conn_verts(&mut self) 
31    -> Result<(),BetweennessCentralityError> 
32    {
33        debug!("finding connection vertices...");
34
35        self.clear_mucs()?;
36
37        let all_muc_edges = self.collect_all_edges_in_mucs_in_one_set()?;
38
39        self.do_simple_subtraction_of_edges_and_update_mucs(&all_muc_edges);
40
41        Ok(())
42    }
43}