Struct FilteredGraph 

pub struct FilteredGraph<'a, N: NodeTrait, E: EdgeTrait> { /* private fields */ }

Implementations

impl<'a, N: NodeTrait, E: EdgeTrait> FilteredGraph<'a, N, E>

pub fn new( base: &'a Graph<N, E>, active_nodes: impl IntoIterator<Item = u32>, ) -> Self

Trait Implementations

impl<N: NodeTrait, E: EdgeTrait> GraphViewTrait<N, E> for FilteredGraph<'_, N, E>

fn is_empty(&self) -> bool

fn get_node(&self, key: u32) -> &N

fn has_node(&self, key: u32) -> bool

fn get_nodes<'b>(&'b self) -> impl Iterator<Item = &'b N>

where N: 'b,

fn get_node_keys(&self) -> impl Iterator<Item = u32>

fn get_edge(&self, source: u32, target: u32) -> &E

fn has_edge(&self, source: u32, target: u32) -> bool

fn get_edges<'b>(&'b self) -> impl Iterator<Item = &'b E>

where E: 'b,

fn get_predecessors<'b>(&'b self, node_key: u32) -> impl Iterator<Item = &'b N>

where N: 'b,

fn get_successors<'b>(&'b self, node_key: u32) -> impl Iterator<Item = &'b N>

where N: 'b,

fn get_successors_keys(&self, node_key: u32) -> impl Iterator<Item = u32>

fn get_predecessors_keys(&self, node_key: u32) -> impl Iterator<Item = u32>

fn filter(&self, node_keys: &[u32]) -> impl GraphViewTrait<N, E>

fn has_sequential_keys(&self) -> bool