Struct DiGraph 

pub struct DiGraph<N>
where
    N: GraphNode,
{ /* private fields */ }

A directed graph using reference-counted nodes.

Implementations

impl<N> DiGraph<N>

where N: GraphNode,

pub fn new(nodes: IndexSet<N>) -> DiGraph<N>

Initializes a new DiGraph from a set of source nodes.

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

Adds a node to the graph.

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

Returns an iterator over the nodes in the graph.

pub fn add_edge(&mut self, from: N, to: N)

Adds an edge to the graph.

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

Removes a node and all associated edges from the graph.

pub fn neighbors(&self, node: &N) -> impl Iterator<Item = &N>

Returns an iterator to the immediate neighbors of a given node.

pub fn transitive_closure(&self, node: &N) -> IndexSet<N>

Returns all the nodes that can be reached by a given node

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

Returns true if the graph contains the given node.

pub fn post_order(&self) -> Result<IndexSet<N>, DiGraphError<N>>

Returns the post-order ordering of the graph. Detects if there is a cycle in the graph.

pub fn post_order_with_filter<F>( &self, filter: F, ) -> Result<IndexSet<N>, DiGraphError<N>>

where F: Fn(&N) -> bool,

Returns the post-order ordering of the graph but only considering a subset of the nodes that satisfy the given filter.

Detects if there is a cycle in the graph.

pub fn retain_nodes(&mut self, keep: &IndexSet<N>)

Retains a subset of the nodes, and removes all edges in which the source or destination is not in the subset.

Trait Implementations

impl<N> Clone for DiGraph<N>

where N: Clone + GraphNode,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N> Debug for DiGraph<N>

where N: Debug + GraphNode,

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

Formats the value using the given formatter.

impl<N> Default for DiGraph<N>

where N: GraphNode,

fn default() -> DiGraph<N>

Returns the “default value” for a type.

impl<N> PartialEq for DiGraph<N>

where N: PartialEq + GraphNode,

fn eq(&self, other: &DiGraph<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> Eq for DiGraph<N>

where N: Eq + GraphNode,

impl<N> StructuralPartialEq for DiGraph<N>

where N: GraphNode,