Trait traitgraph::algo::traversal::TraversalQueueStrategy

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

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

Required methods

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

Insert a node into the queue.

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

Remove and return a node from the queue.

Implementors

impl<Graph: GraphBase, Queue: BidirectedQueue<Graph::NodeIndex>> TraversalQueueStrategy<Graph, Queue> for BfsQueueStrategy

impl<Graph: GraphBase, Queue: BidirectedQueue<Graph::NodeIndex>> TraversalQueueStrategy<Graph, Queue> for DfsQueueStrategy