pub fn shrink_to_core_nodes(&mut self) {
        debug!("Shrinking FBAS to core nodes...",);
        let core_nodes_original = self.fbas_original.core_nodes();
        let (new_fbas_shrunken, new_shrink_manager) =
            Fbas::shrunken(&self.fbas_original, core_nodes_original);
        debug!(
            "Shrank to an FBAS of size {} (from size {}).",
            new_fbas_shrunken.number_of_nodes(),
            self.fbas_shrunken.borrow().number_of_nodes(),
        );
        debug!("Fixing previously cached values...");
        self.reshrink_cached_results(&new_shrink_manager);
        self.fbas_shrunken.replace(new_fbas_shrunken);
        self.shrink_manager.replace(new_shrink_manager);
    }
/// Shrink the FBAS to its core nodes, i.e., to the union of all quorum-containing strongly
/// connected components. Future splitting sets returned by this object will miss any splitting
/// sets that do not consist entirely of core nodes and don't cause at least one pair of core
/// nodes to end up in non-intersecting quorums.
Shrink the FBAS to its core nodes, i.e., to the union of all quorum-containing strongly
connected components. Future splitting sets returned by this object will miss any splitting
sets that do not consist entirely of core nodes and don't cause at least one pair of core
nodes to end up in non-intersecting quorums.
Shrink the FBAS to its core nodes i . e . to the union of all quorum - containing strongly connected components . Future splitting sets returned by this object will miss any splitting sets that do not consist entirely of core nodes and don ' t cause at least one pair of core nodes to end up in non - intersecting quorums .
pub fn shrink_to_core_nodes(&mut self) {
        debug!("Shrinking FBAS to core nodes...",);
        let core_nodes_original = self.fbas_original.core_nodes();
        let (new_fbas_shrunken, new_shrink_manager) =
            Fbas::shrunken(&self.fbas_original, core_nodes_original);
        debug!(
            "Shrank to an FBAS of size {} (from size {}).",
            new_fbas_shrunken.number_of_nodes(),
            self.fbas_shrunken.borrow().number_of_nodes(),
        );
        debug!("Fixing previously cached values...");
        self.reshrink_cached_results(&new_shrink_manager);
        self.fbas_shrunken.replace(new_fbas_shrunken);
        self.shrink_manager.replace(new_shrink_manager);
    }
pub fn shrink_to_core_nodes ( & mut self ) { debug ! ( " " ) ; let core_nodes_original = self . fbas_original . core_nodes ( ) ; let ( new_fbas_shrunken , new_shrink_manager ) = Fbas :: shrunken ( & self . fbas_original , core_nodes_original ) ; debug ! ( " " new_fbas_shrunken number_of_nodes ( ) self fbas_shrunken borrow ( ) number_of_nodes ( ) ) ; debug ! ( " " ) ; self . reshrink_cached_results ( & new_shrink_manager ) ; self . fbas_shrunken . replace ( new_fbas_shrunken ) ; self . shrink_manager . replace ( new_shrink_manager ) ; }
Shrink the FBAS to its core nodes, i.e., to the union of all quorum-containing strongly
connected components.
Shrink the FBAS to its core nodes i . e . to the union of all quorum - containing strongly connected components .
&mut self
&mut self