fn to_minimal_splitting_sets(&self) -> Vec<NodeIdSet> {
        let splitting_sets = self.to_splitting_sets();
        if self.contains_duplicates() {
            remove_non_minimal_node_sets(splitting_sets)
        } else {
            splitting_sets
        }
    }
/// If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS.
If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS.
If ` self ` represents a symmetric quorum cluster this function returns all minimal splitting sets of the induced FBAS .
fn to_minimal_splitting_sets(&self) -> Vec<NodeIdSet> {
        let splitting_sets = self.to_splitting_sets();
        if self.contains_duplicates() {
            remove_non_minimal_node_sets(splitting_sets)
        } else {
            splitting_sets
        }
    }
fn to_minimal_splitting_sets ( & self ) -> Vec < NodeIdSet > { let splitting_sets = self . to_splitting_sets ( ) ; if self . contains_duplicates ( ) { remove_non_minimal_node_sets ( splitting_sets ) } else { splitting_sets } }
If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS.
If ` self ` represents a symmetric quorum cluster this function returns all minimal splitting sets of the induced FBAS .
&self
&self