Struct graphannis_core::graph::storage::union::UnionEdgeContainer

pub struct UnionEdgeContainer<'a> { /* fields omitted */ }

Implementations

impl<'a> UnionEdgeContainer<'a>

pub fn new(containers: Vec<&'a dyn EdgeContainer>) -> UnionEdgeContainer<'a>

Trait Implementations

impl<'a> EdgeContainer for UnionEdgeContainer<'a>

fn get_outgoing_edges<'b>(
    &'b self,
    node: NodeID
) -> Box<dyn Iterator<Item = NodeID> + 'b>

Get all outgoing edges for a given node.

fn get_ingoing_edges<'b>(
    &'b self,
    node: NodeID
) -> Box<dyn Iterator<Item = NodeID> + 'b>

Get all incoming edges for a given node.

fn source_nodes<'b>(&'b self) -> Box<dyn Iterator<Item = NodeID> + 'b>

Provides an iterator over all nodes of this edge container that are the source of an edge

fn has_outgoing_edges(&self, node: NodeID) -> bool

Return true of the given node has any outgoing edges.

fn get_statistics(&self) -> Option<&GraphStatistic>

impl<'a> MallocSizeOf for UnionEdgeContainer<'a>

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.