traitgraph_algo::traversal

Trait TraversalQueueStrategy

Source 
pub trait TraversalQueueStrategy<Graph: GraphBase, Queue: BidirectedQueue<Graph::NodeIndex>> {
    // Required methods
    fn push(queue: &mut Queue, node: Graph::NodeIndex);
    fn pop(queue: &mut Queue) -> Option<Graph::NodeIndex>;
}
Expand description

A type that defines the order of node processing in a traversal, i.e. queue-based or stack-based.

Required Methods§

Source

fn push(queue: &mut Queue, node: Graph::NodeIndex)

Insert a node into the queue.

Source

fn pop(queue: &mut Queue) -> Option<Graph::NodeIndex>

Remove and return a node from the queue.

Dyn Compatibility§

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors§