Struct RecurQueue 

pub struct RecurQueue<P: Params>(/* private fields */);

Queue of lazily-generated pairs of nodes that must next be compared pairwise. The size is limited only by available memory. Specifies use of this.

Does breadth-first traversals. Typically used when it is likely that the input graphs will be deeper than they are wide. Great depth can be handled with very little memory usage, but great width can cause excessive memory usage.

(If, instead, you want to limit how much a recursion-queue can grow, you must impl RecurMode for your own type that does that and use it with the generic API.)

Trait Implementations

impl<P: Params> Default for RecurQueue<P>

fn default() -> Self

Create a new instance with capacity P::INITIAL_CAPACITY.

impl<P: Params> From<CallStack> for RecurQueue<P>

Enables the call-stack to be used for the precheck and the vector-queue for the interleave, if desired.

fn from(_: CallStack) -> Self

Converts to this type from the input type.

impl<E, V> RecurMode<E> for RecurQueue<V>

where E: Params<RecurMode = Self>, V: Params<Node = E::Node>, Infallible: Into<E::Error>,

Enables RecurQueue to be used with the algorithm.

fn reset(self) -> Self

An aborted precheck, that uses RecurQueue, might have left some elements, so we must reset before doing the interleave using the same RecurQueue.

type Error = Infallible

Type of error that can occur.

fn recur( it: &mut Equiv<E>, edges_iter: EdgesIter<E::Node>, ) -> Result<<E::Node as Node>::Cmp, Self::Error>

Arrange for the given nodes to be recurred on, either immediately or later.

fn next(&mut self) -> Option<CounterpartsResult<E::Node>>

Supply the next counterpart nodes for the algorithm to compare, if any were saved for later by Self::recur.