Struct Hyperedge 

pub struct Hyperedge {
    pub id: usize,
    pub nodes: Vec<usize>,
    pub weight: f64,
}

A hyperedge in an indexed hypergraph.

Nodes within a hyperedge are stored in sorted order so that equality checks and set operations are efficient.

Fields

id: usize

Unique identifier (sequential, assigned at insertion time)

nodes: Vec<usize>

Nodes belonging to this hyperedge (sorted, deduplicated)

weight: f64

Non-negative weight (default 1.0)

Implementations

impl Hyperedge

pub fn new(id: usize, nodes: Vec<usize>, weight: f64) -> Self

Create a new hyperedge with automatic deduplication and sorting.

pub fn size(&self) -> usize

Cardinality (number of nodes in this hyperedge).

pub fn contains(&self, node: usize) -> bool

Check whether node is a member of this hyperedge.

pub fn intersection_size(&self, other: &Hyperedge) -> usize

Number of nodes shared with another hyperedge.

Trait Implementations

impl Clone for Hyperedge

fn clone(&self) -> Hyperedge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Hyperedge

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

Formats the value using the given formatter.

impl PartialEq for Hyperedge

fn eq(&self, other: &Hyperedge) -> 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 StructuralPartialEq for Hyperedge