Struct AdjacencyMap 

pub struct AdjacencyMap<T, E> { /* private fields */ }

A graph traversal that builds an adjacency map

Implementations

impl<T, E> AdjacencyMap<T, E>

where T: Eq + Hash + Clone,

pub fn new() -> Self

Creates a new adjacency map

pub fn roots(&self) -> impl Iterator<Item = &T>

Returns an iterator over the root nodes of the graph

pub fn get(&self, node: &T) -> Option<impl Iterator<Item = &(T, E)>>

Returns an iterator over the children of the given node

pub fn len(&self) -> usize

Returns the number of nodes in the graph

pub fn is_empty(&self) -> bool

Returns true if the graph is empty

impl<T, E> AdjacencyMap<T, E>

where T: Eq + Hash + Clone,

pub fn into_postorder_topological(self) -> IntoPostorderTopologicalIter<T, E>

Returns an owned iterator over the nodes in postorder topological order, starting from the roots.

pub fn into_breadth_first_edges(self) -> IntoBreadthFirstEdges<T, E>

Returns an owned iterator over all edges (node pairs) in reverse breadth first order, starting from the roots.

pub fn postorder_topological(&self) -> PostorderTopologicalIter<'_, T, E>

Returns an iterator over the nodes in postorder topological order, starting from the roots.

pub fn postorder_topological_from_node<'graph>( &'graph self, node: &'graph T, ) -> PostorderTopologicalIter<'graph, T, E>

Returns an iterator over the nodes in postorder topological order, starting from the given node.

Trait Implementations

impl<T: Clone, E: Clone> Clone for AdjacencyMap<T, E>

fn clone(&self) -> AdjacencyMap<T, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, E: Debug> Debug for AdjacencyMap<T, E>

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

Formats the value using the given formatter.

impl<T, E> Default for AdjacencyMap<T, E>

where T: Eq + Hash + Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<T, E> GraphStore for AdjacencyMap<T, E>

where T: Eq + Hash + Clone + Send, E: Send,

type Node = T

type Edge = E

type Handle = T

fn insert(&mut self, from: Option<(&T, E)>, node: T)

Inserts a node into the graph store, and returns a handle to it.

fn try_enter(&mut self, node: &T) -> Option<T>

Tries to enter a node during traversal for visiting its edges. Returns true if the node edges should be visited. Returns false if the node has already been visited and should not be explored again.

impl<T, E> PartialEq for AdjacencyMap<T, E>

where T: Eq + Hash, E: Eq,

fn eq(&self, other: &Self) -> 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<T: TraceRawVcs, E: TraceRawVcs> TraceRawVcs for AdjacencyMap<T, E>

fn trace_raw_vcs(&self, __context__: &mut TraceRawVcsContext)

fn get_raw_vcs(&self) -> Vec<RawVc>

impl<T: ValueDebugFormat + Debug + Send + Sync, E: ValueDebugFormat + Debug + Send + Sync> ValueDebugFormat for AdjacencyMap<T, E>

fn value_debug_format<'a>(&'a self, depth: usize) -> ValueDebugFormatString<'a>

impl<T, E> Eq for AdjacencyMap<T, E>

where T: Eq + Hash, E: Eq,

impl<T, E> NonLocalValue for AdjacencyMap<T, E>

where T: NonLocalValue, E: NonLocalValue,