minimal_transversals

scirs2_graph::algorithms::hypergraph

Function minimal_transversals 

Source 
pub fn minimal_transversals<N, E, Ix>(
    hypergraph: &Hypergraph<N, E, Ix>,
    max_size: Option<usize>,
) -> Vec<MinimalTransversal<N>>
where
    N: Node + Clone + Ord + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Find all minimal transversals (hitting sets) of a hypergraph

A transversal is a set of nodes that intersects every hyperedge. This is also known as the hitting set problem.

§Arguments

  • hypergraph - The hypergraph to analyze
  • max_size - Maximum size of transversals to consider (for efficiency)

§Returns

  • Vector of minimal transversals