Struct Hypergraph 

pub struct Hypergraph<N: Node, E: EdgeWeight, Ix: IndexType = u32> { /* private fields */ }

A hypergraph structure

Implementations

impl<N: Node + Debug, E: EdgeWeight, Ix: IndexType> Hypergraph<N, E, Ix>

pub fn new() -> Self

Create a new empty hypergraph

pub fn nodes(&self) -> impl Iterator<Item = &N>

Get all nodes in the hypergraph

pub fn hyperedges(&self) -> &Vec<Hyperedge<N, E>>

Get all hyperedges in the hypergraph

pub fn has_node(&self, node: &N) -> bool

Check if the hypergraph has a node

pub fn add_node(&mut self, node: N) -> NodeIndex<Ix>

Add a node to the hypergraph

pub fn add_hyperedge_from_vec( &mut self, nodes: Vec<N>, weight: E, ) -> Result<usize>

where N: Clone,

Add a hyperedge from a vector of nodes

pub fn add_hyperedge(&mut self, nodes: Vec<N>, weight: E) -> Result<usize>

where N: Clone,

Add a hyperedge

pub fn are_connected(&self, source: &N, target: &N) -> bool

where N: PartialEq,

Check if two nodes are connected through any hyperedge

pub fn connecting_hyperedges( &self, source: &N, target: &N, ) -> Vec<&Hyperedge<N, E>>

where N: PartialEq,

Get hyperedges that connect two nodes

pub fn hyperedges_containing_node(&self, node: &N) -> Vec<&Hyperedge<N, E>>

where N: PartialEq,

Get all hyperedges containing a specific node

pub fn neighbors(&self, node: &N) -> Vec<N>

where N: Clone + PartialEq,

Get neighbors of a node (all nodes connected through hyperedges)

pub fn to_graph(&self) -> Graph<N, E, Ix>

where N: Clone, E: Clone + Default,

Convert hypergraph to a regular graph (2-section)

pub fn node_count(&self) -> usize

Get the number of nodes in the hypergraph

pub fn hyperedge_count(&self) -> usize

Get the number of hyperedges in the hypergraph

pub fn degree(&self, node: &N) -> usize

where N: PartialEq,

Get the degree of a node (number of hyperedges it belongs to)

pub fn remove_hyperedge( &mut self, hyperedge_id: usize, ) -> Result<Hyperedge<N, E>>

where N: Clone, E: Clone,

Remove a hyperedge by its ID

pub fn incidence_matrix(&self) -> Vec<Vec<f64>>

where N: Clone + PartialEq,

Get the incidence matrix of the hypergraph Returns a matrix where rows represent nodes and columns represent hyperedges A value of 1.0 indicates the node is in the hyperedge, 0.0 otherwise

pub fn maximal_cliques(&self) -> Vec<Vec<N>>

where N: Clone + PartialEq,

Find maximal cliques in the hypergraph This is a simplified implementation that finds connected components A more sophisticated algorithm would be needed for true maximal cliques

pub fn hyperedge_size_stats(&self) -> (usize, usize, f64)

Get statistics about hyperedge sizes Returns (min_size, max_size, avg_size)

pub fn is_uniform(&self) -> bool

Check if the hypergraph is uniform (all hyperedges have the same size)

Trait Implementations

impl<N: Node + Debug, E: EdgeWeight, Ix: IndexType> Default for Hypergraph<N, E, Ix>

fn default() -> Self

Returns the “default value” for a type.