Struct Graph 

pub struct Graph<N, E> { /* private fields */ }

Implementations

impl<N: NodeTrait, E: EdgeTrait> Graph<N, E>

pub fn new(nodes: Vec<N>, edges: Vec<E>) -> Self

pub fn add_node(&mut self, node: N) -> bool

pub fn remove_node(&mut self, key: u32)

pub fn add_edge(&mut self, edge: E) -> bool

pub fn remove_edge(&mut self, source: u32, target: u32)

Trait Implementations

impl<N: Debug, E: Debug> Debug for Graph<N, E>

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

Formats the value using the given formatter.

impl<N: NodeTrait, E: EdgeTrait> Display for Graph<N, E>

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

Formats the value using the given formatter.

impl<N: NodeTrait, E: EdgeTrait> GraphViewTrait<N, E> for Graph<N, E>

fn is_empty(&self) -> bool

fn has_sequential_keys(&self) -> bool

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

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

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

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

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

where N: 'a,

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

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

where E: 'a,

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

where N: 'a,

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

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

where N: 'a,

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

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