scirs2_graph::algorithms::hypergraph

Function hypergraph_diameter

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

Compute the hypergraph diameter

The diameter is the maximum distance between any pair of connected nodes, where distance is the minimum number of hyperedges in a path.

§Arguments

  • hypergraph - The hypergraph to analyze

§Returns

  • The diameter, or None if the hypergraph is disconnected