Type Alias StandardLabeledGraph

pub type StandardLabeledGraph = SimpleLabeledGraph<String, SingleLabel>;

Aliased Type

struct StandardLabeledGraph { /* private fields */ }

Implementations

impl StandardLabeledGraph

pub fn new() -> Self

pub fn add_node(&mut self, id: u64, label: String)

pub fn add_edge(&mut self, src: u64, dst: u64)

Trait Implementations

impl Adjacency<'_> for StandardLabeledGraph

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 StandardLabeledGraph

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 Display for StandardLabeledGraph

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

Formats the value using the given formatter.

impl<'a> Graph<'a> for StandardLabeledGraph

type Node = LabelNode<String>

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<'a> Labeled<'a> for StandardLabeledGraph

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, edge1: &Self::Edge, edge2: &Self::Edge) -> bool

fn edge_node_label_same( &self, src1: &Self::Node, edge1: &Self::Edge, dst1: &Self::Node, src2: &Self::Node, edge2: &Self::Edge, dst2: &Self::Node, ) -> bool

impl LabeledAdjacency<'_> for StandardLabeledGraph

fn get_labeled_adj(&'a self) -> LabeledAdjacencyList<'a, Self>

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

impl Directed for StandardLabeledGraph