[−][src]Trait bigraph::traversal::TraversalQueueStrategy
Required methods
fn push(queue: &mut Queue, node: <Graph as GraphBase>::NodeIndex)
fn pop(queue: &mut Queue) -> Option<<Graph as GraphBase>::NodeIndex>
Implementors
impl<Graph, Queue> TraversalQueueStrategy<Graph, Queue> for BfsQueueStrategy where
Graph: GraphBase,
Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>,
[src]
Graph: GraphBase,
Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>,
fn push(queue: &mut Queue, node: <Graph as GraphBase>::NodeIndex)
[src]
fn pop(queue: &mut Queue) -> Option<<Graph as GraphBase>::NodeIndex>
[src]
impl<Graph, Queue> TraversalQueueStrategy<Graph, Queue> for DfsQueueStrategy where
Graph: GraphBase,
Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>,
[src]
Graph: GraphBase,
Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>,