Struct SimpleDirectedGraph 

pub struct SimpleDirectedGraph<N>
where
    N: Clone + Eq + Hash,
{ /* private fields */ }

An immutable directed graph with nodes of type N and a minimal interface for iterating over nodes and their adjacent nodes.

Implementations

impl<N> SimpleDirectedGraph<N>

where N: Clone + Eq + Hash,

pub fn new<EI>(edges: EI) -> Self

where EI: IntoIterator<Item = (N, N)>,

Constructs a new SimpleDirectedGraph from a list of edges.

pub fn nodes(&self) -> impl Iterator<Item = &N>

Returns the nodes in this graph.

pub fn num_nodes(&self) -> usize

Returns the nodes in this graph.

pub fn edges(&self) -> impl Iterator<Item = (&N, &N)>

Returns the edges in this graph.

pub fn adjacent_nodes( &self, node: &N, ) -> Option<impl DoubleEndedIterator<Item = &N>>

Returns the adjacent nodes for the given node, or None if the node is not in the graph.

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

Returns true if this graph contains the given node.

pub fn get_postorder<'a>(&'a self, start_node: &'a N) -> Vec<&'a N>

Returns a postorder traversal of the nodes in this graph starting from the given node.

Trait Implementations

impl<N> Clone for SimpleDirectedGraph<N>

where N: Clone + Eq + Hash + Clone,

fn clone(&self) -> SimpleDirectedGraph<N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N> Debug for SimpleDirectedGraph<N>

where N: Clone + Eq + Hash + Debug,

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

Formats the value using the given formatter.

impl<N> Eq for SimpleDirectedGraph<N>

where N: Clone + Eq + Hash + Eq,

impl<N> PartialEq for SimpleDirectedGraph<N>

where N: Clone + Eq + Hash + PartialEq,

fn eq(&self, other: &SimpleDirectedGraph<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N> StructuralPartialEq for SimpleDirectedGraph<N>

where N: Clone + Eq + Hash,