Struct HyperGraph 

pub struct HyperGraph { /* private fields */ }

A hypergraph where edges can connect any number of vertices.

Example

use problemreductions::topology::HyperGraph;

// Create a hypergraph with 4 vertices and 2 hyperedges
let hg = HyperGraph::new(4, vec![
    vec![0, 1, 2],  // Edge connecting vertices 0, 1, 2
    vec![2, 3],     // Edge connecting vertices 2, 3
]);

assert_eq!(hg.num_vertices(), 4);
assert_eq!(hg.num_edges(), 2);

Implementations

impl HyperGraph

pub fn new(num_vertices: usize, edges: Vec<Vec<usize>>) -> Self

Create a new hypergraph.

Panics

Panics if any vertex index in an edge is out of bounds.

pub fn empty(num_vertices: usize) -> Self

Create an empty hypergraph with no edges.

pub fn num_vertices(&self) -> usize

Get the number of vertices.

pub fn num_edges(&self) -> usize

Get the number of hyperedges.

pub fn edges(&self) -> &[Vec<usize>]

Get all hyperedges.

pub fn edge(&self, index: usize) -> Option<&Vec<usize>>

Get a specific edge by index.

pub fn has_edge(&self, edge: &[usize]) -> bool

Check if a hyperedge exists (order-independent).

pub fn neighbors(&self, v: usize) -> Vec<usize>

Get all vertices adjacent to vertex v (share a hyperedge with v).

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

Get the degree of a vertex (number of hyperedges containing it).

pub fn edges_containing(&self, v: usize) -> Vec<&Vec<usize>>

Get all edges containing a specific vertex.

pub fn add_edge(&mut self, edge: Vec<usize>)

Add a new hyperedge.

Panics

Panics if any vertex index is out of bounds.

pub fn max_edge_size(&self) -> usize

Get the maximum edge size (maximum number of vertices in any hyperedge).

pub fn is_regular_graph(&self) -> bool

Check if this is a regular graph (all edges have size 2).

pub fn to_graph_edges(&self) -> Option<Vec<(usize, usize)>>

Convert to a regular graph if possible (all edges size 2). Returns None if any edge has size != 2.

Trait Implementations

impl Clone for HyperGraph

fn clone(&self) -> HyperGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for HyperGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for HyperGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for HyperGraph

fn eq(&self, other: &HyperGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for HyperGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for HyperGraph

impl StructuralPartialEq for HyperGraph