[][src]Trait prty_bitgraph::Graph

pub trait Graph {
    type Node;
    fn nb_nodes(&self) -> usize;
fn nodes(&self) -> Box<dyn Iterator<Item = Self::Node>>;
fn get(&self, from: &Self::Node, to: &Self::Node) -> bool;
fn set_edge(&mut self, from: &Self::Node, to: &Self::Node, _: bool); fn clear_all_to(&mut self, to: &Self::Node) { ... }
fn add_all_to<I>(&mut self, to: &Self::Node, from: I)
    where
        I: IntoIterator<Item = Self::Node>
, { ... }
fn set_all_to<I>(&mut self, to: &Self::Node, from: I)
    where
        I: IntoIterator<Item = Self::Node>
, { ... }
fn clear_all_from(&mut self, from: &Self::Node) { ... }
fn add_all_from<I>(&mut self, from: &Self::Node, to: I)
    where
        I: IntoIterator<Item = Self::Node>
, { ... }
fn set_all_from<I>(&mut self, from: &Self::Node, to: I)
    where
        I: IntoIterator<Item = Self::Node>
, { ... }
fn iter_from<'a>(
        &'a self,
        from: Self::Node
    ) -> Box<dyn Iterator<Item = Self::Node> + 'a> { ... }
fn iter_to<'a>(
        &'a self,
        to: Self::Node
    ) -> Box<dyn Iterator<Item = Self::Node> + 'a> { ... }
fn has_from<'a>(&'a self, from: &Self::Node) -> bool { ... }
fn has_to<'a>(&'a self, to: &Self::Node) -> bool { ... }
fn iter_from_drain<'a>(
        &'a mut self,
        from: Self::Node
    ) -> Box<dyn Iterator<Item = Self::Node> + 'a> { ... }
fn drain_from_and_clear_all_to_drained<'a>(
        &'a mut self,
        from: Self::Node
    ) -> Box<dyn Iterator<Item = Self::Node> + 'a> { ... }
fn clear(&mut self) { ... } }

Associated Types

Required Methods

Provided Methods

Implementors

impl Graph for BitGraph
[src]

impl Graph for SparseGraph
[src]

impl<G: Graph> Graph for Transpose<G>
[src]

impl<G: Graph, T> Graph for MapGraph<G, T> where
    T: 'static + From<G::Node>,
    G::Node: 'static + for<'a> From<&'a T>, 
[src]