Trait graphannis_core::graph::storage::EdgeContainer

pub trait EdgeContainer: Sync + Send + MallocSizeOf {
    fn get_outgoing_edges<'a>(
        &'a self, 
        node: NodeID
    ) -> Box<dyn Iterator<Item = NodeID> + 'a>;
    fn get_ingoing_edges<'a>(
        &'a self, 
        node: NodeID
    ) -> Box<dyn Iterator<Item = NodeID> + 'a>;
    fn source_nodes<'a>(&'a self) -> Box<dyn Iterator<Item = NodeID> + 'a>;

    fn has_outgoing_edges(&self, node: NodeID) -> bool { ... }
    fn get_statistics(&self) -> Option<&GraphStatistic> { ... }
}

Basic trait for accessing edges of a graph for a specific component.

Required methods

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

Get all outgoing edges for a given node.

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

Get all incoming edges for a given node.

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

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

Provided methods

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

Return true of the given node has any outgoing edges.

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

Implementors

impl EdgeContainer for AdjacencyListStorage

impl EdgeContainer for DenseAdjacencyListStorage

impl EdgeContainer for DiskAdjacencyListStorage

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

impl<OrderT: 'static, LevelT: 'static> EdgeContainer for PrePostOrderStorage<OrderT, LevelT> where
    for<'de> OrderT: NumValue + Deserialize<'de> + Serialize,
    for<'de> LevelT: NumValue + Deserialize<'de> + Serialize, 

impl<PosT: 'static> EdgeContainer for LinearGraphStorage<PosT> where
    PosT: NumValue,