Struct HyperLabelGraph

pub struct HyperLabelGraph<L: Label> { /* private fields */ }

Implementations

impl<L: Label> HyperLabelGraph<L>

pub fn new() -> Self

Trait Implementations

impl Adjacency<'_> for HyperLabelGraph<SingleLabel>

fn get_adj(&'a self) -> AdjacencyList<'a, Self>

fn get_post( &'a self, adj: &AdjacencyList<'a, Self>, node: &Self::Node, ) -> impl Iterator<Item = &'a Self::Node>

impl AdjacencyInv<'_> for HyperLabelGraph<SingleLabel>

fn get_adj_inv(&'a self) -> AdjacencyList<'a, Self>

fn get_pre( &'a self, adj_inv: &AdjacencyList<'a, Self>, node: &Self::Node, ) -> impl Iterator<Item = &'a Self::Node>

impl<'a, L: Label> Graph<'a> for HyperLabelGraph<L>

type Node = LabelNode<L>

type Edge = LabeledEdge<SingleLabel>

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

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

fn add_node(&mut self, node: Self::Node)

fn add_edge(&mut self, edge: Self::Edge)

fn get_edges_pair( &'a self, ) -> impl Iterator<Item = (&'a Self::Node, &'a Self::Node)>

fn get_edges_pair_with_edge( &'a self, ) -> impl Iterator<Item = (&'a Self::Node, &'a Self::Edge, &'a Self::Node)>

impl<L: Label> HyperLabeled<'_> for HyperLabelGraph<L>

type L = L

fn set_same_label_fn(&mut self, f: Box<dyn Fn(&Self::L, &Self::L) -> bool>)

impl<'a, L: Label> Labeled<'a> for HyperLabelGraph<L>

fn label_same(&self, node: &Self::Node, label: &Self::Node) -> bool

fn get_label(&'a self, node: &'a Self::Node) -> &'a impl Label

fn get_edges_pair_label( &'a self, ) -> impl Iterator<Item = (&'a Self::Node, &'a Self::Node, &'a impl Label)>

fn edge_label_same(&self, _: &Self::Edge, _: &Self::Edge) -> bool

fn edge_node_label_same( &self, _: &Self::Node, _: &Self::Edge, _: &Self::Node, _: &Self::Node, _: &Self::Edge, _: &Self::Node, ) -> bool

impl Directed for HyperLabelGraph<SingleLabel>