Struct Hypergraph 

pub struct Hypergraph<N> { /* private fields */ }

Implementations

impl<N> Hypergraph<N>

pub fn new() -> Self

pub fn add_node(&mut self, data: N, position: Vec2) -> NodeId

pub fn add_hyperedge(&mut self, members: Vec<NodeId>) -> HyperedgeId

pub fn add_hyperedge_colored( &mut self, members: Vec<NodeId>, color: [f32; 4], ) -> HyperedgeId

pub fn remove_node(&mut self, id: NodeId)

pub fn remove_hyperedge(&mut self, id: HyperedgeId)

pub fn node_count(&self) -> usize

pub fn hyperedge_count(&self) -> usize

pub fn get_node(&self, id: NodeId) -> Option<&HypernodeData<N>>

pub fn get_hyperedge(&self, id: HyperedgeId) -> Option<&HyperedgeData>

pub fn node_ids(&self) -> Vec<NodeId>

pub fn hyperedge_ids(&self) -> Vec<HyperedgeId>

pub fn convex_hull(&self, he_id: HyperedgeId) -> Vec<Vec2>

Compute convex hull of member node positions for rendering a hyperedge.

pub fn to_bipartite(&self) -> Graph<String, ()>

where N: Debug,

Convert hypergraph to bipartite graph representation. Each hyperedge becomes a node, connected to all its member nodes.

pub fn from_bipartite(graph: &Graph<String, ()>) -> Hypergraph<String>

Create a hypergraph from a bipartite graph. Nodes labeled “hedge_*” become hyperedges, others become nodes.

Trait Implementations

impl<N: Clone> Clone for Hypergraph<N>

fn clone(&self) -> Hypergraph<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for Hypergraph<N>

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

Formats the value using the given formatter.