icentral_graph/
find_all_muc_subgraphs.rs

1crate::ix!();
2
3impl<GH> FindAllMucSubgraphs for Graph<GH> 
4
5where GH
6: GetEdges
7+ ClearMucs
8+ CreateNamedEmpty
9+ Debug
10+ ExtendWith<GH,Error=BetweennessCentralityError>
11+ FindConnectedComponents<GH,Error=BetweennessCentralityError>
12+ GetConnectedComponentSizes
13+ GetNeighborsForNode
14+ GetNodeIdRange
15+ HasMapForNode
16+ InsertEdge
17+ InsertNode
18+ IsValid
19+ MappedNodes
20+ NewFromCycleVec
21+ NewFromGraphRef<Self>
22+ NumEdges
23+ NumNodes
24+ RemoveBridges
25{
26    /// find the disconnected subgraphs that will
27    /// result from the deletion of connection
28    /// vertices
29    ///
30    fn find_all_muc_subgraphs(&mut self) {
31
32        debug!("finding MinimumUnionCycle subgraphs...");
33
34        for m in 0..self.mucs.len() {
35            self.find_muc_subgraphs(mucid![m]);
36        }
37    }
38}