pub fn find_nonintersecting_quorums(fbas: &Fbas) -> Option<Vec<NodeIdSet>> {
    info!("Starting to look for potentially non-intersecting quorums...");
    let quorums = find_sets(fbas, nonintersecting_quorums_finder);
    if quorums.len() < 2 {
        info!("Found no non-intersecting quorums.");
        None
    } else {
        warn!(
            "Found {} non-intersecting quorums (there could more).",
            quorums.len()
        );
        Some(quorums)
    }
}
/// Find at least two non-intersecting quorums. Use this function if you don't want to enumerate
/// all minimal quorums and/or it is likely that the FBAS lacks quorum intersection and you want to
/// stop early in such cases.
Find at least two non-intersecting quorums. Use this function if you don't want to enumerate
all minimal quorums and/or it is likely that the FBAS lacks quorum intersection and you want to
stop early in such cases.
Find at least two non - intersecting quorums . Use this function if you don ' t want to enumerate all minimal quorums and / or it is likely that the FBAS lacks quorum intersection and you want to stop early in such cases .
pub fn find_nonintersecting_quorums(fbas: &Fbas) -> Option<Vec<NodeIdSet>> {
    info!("Starting to look for potentially non-intersecting quorums...");
    let quorums = find_sets(fbas, nonintersecting_quorums_finder);
    if quorums.len() < 2 {
        info!("Found no non-intersecting quorums.");
        None
    } else {
        warn!(
            "Found {} non-intersecting quorums (there could more).",
            quorums.len()
        );
        Some(quorums)
    }
}
pub fn find_nonintersecting_quorums ( fbas : & Fbas ) -> Option < Vec < NodeIdSet > > { info ! ( " " ) ; let quorums = find_sets ( fbas , nonintersecting_quorums_finder ) ; if quorums . len ( ) < 2 { info ! ( " " ) ; None } else { warn ! ( " " quorums len ( ) ) ; Some ( quorums ) } }
Find at least two non-intersecting quorums.
Find at least two non - intersecting quorums .
fbas
&Fbas
fbas
&Fbas