Expand description
Hypergraph algorithms
This module contains algorithms specifically designed for hypergraphs, including transversals, cuts, and hypergraph-specific analysis methods.
Structs§
- Hypergraph
Cut - Result of hypergraph cut analysis
- Minimal
Transversal - Represents a minimal transversal (hitting set) of a hypergraph
Functions§
- hyperedge_
connectivity - Compute hypergraph connectivity between two nodes
- hypergraph_
connected_ components - Find strongly connected components in a directed hypergraph
- hypergraph_
diameter - Compute the hypergraph diameter
- hypergraph_
distance - Compute the distance between two nodes in a hypergraph
- is_
hypergraph_ connected - Check if a hypergraph is connected
- minimal_
transversals - Find all minimal transversals (hitting sets) of a hypergraph
- minimum_
vertex_ cut - Find the minimum vertex cut in a hypergraph