Trait graphannis::graph::EdgeContainer

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

    fn has_outgoing_edges(&self, node: u64) -> 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 self,
    node: u64
) -> Box<dyn Iterator<Item = u64> + 'a, Global>

Get all outgoing edges for a given node.

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

Get all incoming edges for a given node.

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

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: u64) -> bool

Return true of the given node has any outgoing edges.

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

Implementations on Foreign Types

impl EdgeContainer for AdjacencyListStorage

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

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

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

pub fn source_nodes(&'a self) -> Box<dyn Iterator<Item = u64> + 'a, Global>

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

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

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

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

pub fn source_nodes(&'b self) -> Box<dyn Iterator<Item = u64> + 'b, Global>

impl EdgeContainer for DenseAdjacencyListStorage

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

Get all outgoing edges for a given node.

pub fn source_nodes(&'a self) -> Box<dyn Iterator<Item = u64> + 'a, Global>

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

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

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

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

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

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

pub fn source_nodes(&'a self) -> Box<dyn Iterator<Item = u64> + 'a, Global>

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

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

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

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

pub fn source_nodes(&'a self) -> Box<dyn Iterator<Item = u64> + 'a, Global>

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

impl EdgeContainer for DiskAdjacencyListStorage

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

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

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

pub fn source_nodes(&'a self) -> Box<dyn Iterator<Item = u64> + 'a, Global>

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

Implementors