mhgl 0.1.5

Matts HyperGraph Library (MHGL). A straightforward library for hypergraph datastructures. Not a database.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

use std::{collections::HashSet, hash::Hash};

use serde::{Serialize};

/// The basic trait that "subsets" of nodes, which correspond to basis states
/// of our vector space, need to follow to be represented in hyperedges.
pub trait HgBasis: PartialEq + Eq + Hash + Clone + Serialize {
    fn new_empty() -> Self;
    fn len(&self) -> usize;
    fn intersect_with(&mut self, rhs: &Self);
    fn intersection(&self, rhs: &Self) -> Self;
    fn union_with(&mut self, rhs: &Self);
    fn union(&self, rhs: &Self) -> Self;
    // The reason for using Self to represent a node is
    // easy compatibility with BitNodes
    // TODO: Check if this should be a node?
    fn add_node(&mut self, node: &Self) {
        self.union_with(node);
    }
    fn add_nodes(&mut self, nodes: &HashSet<Self>) {
        for node in nodes.iter() {
            self.union_with(node);
        }
    }
    fn remove_node(&mut self, node: &Self);
    fn complement(&self, rhs: &Self) -> Self;
    fn covers_basis(&self, basis: &Self) -> bool {
        let intersection = self.intersection(basis);
        intersection == *basis
    }
    fn nodes(&self) -> HashSet<Self>;
}