Struct NonDeterministic 

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

A graph traversal that does not guarantee any particular order, and may not return the same order every time it is run.

Implementations

impl<T, E> NonDeterministic<T, E>

pub fn new() -> Self

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

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

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

type Node = T

type Edge = E

type Handle = ()

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

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

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

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> IntoIterator for NonDeterministic<T, E>

type Item = T

The type of the elements being iterated over.

type IntoIter = <Vec<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.