Struct BipartiteHypergraph 

pub struct BipartiteHypergraph<N, E> { /* private fields */ }

A hypergraph that preserves the bipartiteness invariant. Because of partiteness-weirdness, this has to be directed. I might make a different k-partite undirected graph over k-uniform hypergraphs.

Implementations

impl<N, E> BipartiteHypergraph<N, E>

where N: Clone + Eq + Hash, E: Clone + Eq + Hash,

pub fn new() -> Self

Examples found in repository

examples/partite.rs (line 14)

fn main() {
    let mut g = partite::BipartiteGraph::<(), ()>::new();
    // g.add_node((), 0);
    // g.add_node((), 0);
    // g.add_node((), 1);
    g.add_nodes([((), 0), ((), 0), ((), 1)].into_iter());

    dbg!(g.add_edge((), [0, 2])); // Ok
    dbg!(g.add_edge((), [0, 1])); // Err

    let mut g = partite::directed_bipartite::BipartiteHypergraph::<(), ()>::new();
    // g.add_node((), false);
    // g.add_node((), false);
    // g.add_node((), true);
    g.add_nodes([((), false), ((), false), ((), true)].into_iter());

    dbg!(g.add_edge((), vec![0], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0], vec![1])); // Err
    dbg!(g.add_edge((), vec![0, 1], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0, 2], vec![1])); // Err

    let mut g = partite::kpartite::PartiteHypergraph::<(), (), 3>::new();
    // g.add_node((), 0);
    // g.add_node((), 1);
    // g.add_node((), 2);
    // g.add_node((), 2);
    g.add_nodes([((), 0), ((), 1), ((), 2), ((), 2)].into_iter());
    dbg!(g.add_edge((), vec![0, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2, 3])); // Err
}

pub fn add_node(&mut self, weight: N, side: bool) -> usize

pub fn add_edge( &mut self, weight: E, source_indices: Vec<usize>, target_indices: Vec<usize>, ) -> Result<usize, HypergraphErrors>

Examples found in repository

examples/partite.rs (line 20)

fn main() {
    let mut g = partite::BipartiteGraph::<(), ()>::new();
    // g.add_node((), 0);
    // g.add_node((), 0);
    // g.add_node((), 1);
    g.add_nodes([((), 0), ((), 0), ((), 1)].into_iter());

    dbg!(g.add_edge((), [0, 2])); // Ok
    dbg!(g.add_edge((), [0, 1])); // Err

    let mut g = partite::directed_bipartite::BipartiteHypergraph::<(), ()>::new();
    // g.add_node((), false);
    // g.add_node((), false);
    // g.add_node((), true);
    g.add_nodes([((), false), ((), false), ((), true)].into_iter());

    dbg!(g.add_edge((), vec![0], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0], vec![1])); // Err
    dbg!(g.add_edge((), vec![0, 1], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0, 2], vec![1])); // Err

    let mut g = partite::kpartite::PartiteHypergraph::<(), (), 3>::new();
    // g.add_node((), 0);
    // g.add_node((), 1);
    // g.add_node((), 2);
    // g.add_node((), 2);
    g.add_nodes([((), 0), ((), 1), ((), 2), ((), 2)].into_iter());
    dbg!(g.add_edge((), vec![0, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2, 3])); // Err
}

pub fn add_nodes(&mut self, weights: impl Iterator<Item = (N, bool)>)

Examples found in repository

examples/partite.rs (line 18)

fn main() {
    let mut g = partite::BipartiteGraph::<(), ()>::new();
    // g.add_node((), 0);
    // g.add_node((), 0);
    // g.add_node((), 1);
    g.add_nodes([((), 0), ((), 0), ((), 1)].into_iter());

    dbg!(g.add_edge((), [0, 2])); // Ok
    dbg!(g.add_edge((), [0, 1])); // Err

    let mut g = partite::directed_bipartite::BipartiteHypergraph::<(), ()>::new();
    // g.add_node((), false);
    // g.add_node((), false);
    // g.add_node((), true);
    g.add_nodes([((), false), ((), false), ((), true)].into_iter());

    dbg!(g.add_edge((), vec![0], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0], vec![1])); // Err
    dbg!(g.add_edge((), vec![0, 1], vec![2])); // Ok
    dbg!(g.add_edge((), vec![0, 2], vec![1])); // Err

    let mut g = partite::kpartite::PartiteHypergraph::<(), (), 3>::new();
    // g.add_node((), 0);
    // g.add_node((), 1);
    // g.add_node((), 2);
    // g.add_node((), 2);
    g.add_nodes([((), 0), ((), 1), ((), 2), ((), 2)].into_iter());
    dbg!(g.add_edge((), vec![0, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2])); // Ok
    dbg!(g.add_edge((), vec![0, 1, 2, 3])); // Err
}

pub fn add_edges( &mut self, edges: impl Iterator<Item = (E, Vec<usize>, Vec<usize>)>, ) -> Result<(), HypergraphErrors>

pub fn remove_node(&mut self, node_index: usize) -> Option<DirectedNode<N>>

pub fn remove_nodes(&mut self, node_indices: Vec<usize>) -> Vec<DirectedNode<N>>

pub fn remove_edge(&mut self, edge_index: usize) -> Option<DirectedEdge<E>>

pub fn remove_edges(&mut self, edge_indices: Vec<usize>) -> Vec<DirectedEdge<E>>

pub fn get_in_neighbours(&self, node_index: usize) -> Option<HashSet<&usize>>

pub fn get_out_neighbours(&self, node_index: usize) -> Option<HashSet<&usize>>

pub fn get_in_edges(&self, node_index: usize) -> Option<&Vec<usize>>

pub fn get_out_edges(&self, node_index: usize) -> Option<&Vec<usize>>

pub fn induced_shgraph(&self, node_indices: &[usize]) -> Self

where E: Clone + Eq + Hash, N: Clone,

pub fn shgraph_by_order<const ORDER: usize>( &self, ) -> UniformHypergraph<N, E, ORDER>

where E: Clone + Eq + Hash, N: Clone,

Maybe change this to kpartite once I do that.

Trait Implementations

impl<'a, N, E> GraphBasics<'a> for BipartiteHypergraph<N, E>

where N: 'a + Clone + Eq + Hash, E: 'a + Clone + Eq + Hash,

type NodeRef = <Hypergraph<N, E> as GraphBasics<'a>>::NodeRef

type EdgeRef = <Hypergraph<N, E> as GraphBasics<'a>>::EdgeRef

type EdgeIndex = <Hypergraph<N, E> as GraphBasics<'a>>::EdgeIndex

type NodeIndex = <Hypergraph<N, E> as GraphBasics<'a>>::NodeIndex

fn nodes(&'a self) -> impl Iterator<Item = Self::NodeRef>

fn edges(&'a self) -> impl Iterator<Item = Self::EdgeRef>

fn node_count(&'a self) -> usize

fn edge_count(&'a self) -> usize

fn is_directed(&self) -> bool

fn node( &'a self, node_index: <Self as GraphBasics<'a>>::NodeIndex, ) -> Option<<Self as GraphBasics<'a>>::NodeRef>

fn edge( &'a self, edge_index: <Self as GraphBasics<'a>>::EdgeIndex, ) -> Option<<Self as GraphBasics<'a>>::EdgeRef>

fn node_iter( &'a self, node_index: impl Iterator<Item = <Self as GraphBasics<'a>>::NodeIndex>, ) -> impl Iterator<Item = Option<<Self as GraphBasics<'a>>::NodeRef>>

fn edge_iter( &'a self, edge_index: impl Iterator<Item = <Self as GraphBasics<'a>>::EdgeIndex>, ) -> impl Iterator<Item = Option<<Self as GraphBasics<'a>>::EdgeRef>>

impl<'a, N, E> GraphWrapper<'a> for BipartiteHypergraph<N, E>

where DirectedHypergraph<N, E>: GraphBasics<'a>, N: 'a + Clone + Eq + Hash, E: 'a + Clone + Eq + Hash,

type Inner = Hypergraph<N, E>

fn into_inner(&'a self) -> &'a Self::Inner