Struct traitgraph::algo::traversal::BfsQueueStrategy[−][src]

pub struct BfsQueueStrategy;

Expand description

A queue strategy that works by the first-in first-out principle.

Trait Implementations

[src]

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

[src]

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

Insert a node into the queue.

[src]

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

Remove and return a node from the queue.

Auto Trait Implementations

impl RefUnwindSafe for BfsQueueStrategy

impl Send for BfsQueueStrategy

impl Sync for BfsQueueStrategy

impl Unpin for BfsQueueStrategy

impl UnwindSafe for BfsQueueStrategy

Blanket Implementations

[src]

impl<T> Any for T where
T: 'static + ?Sized,

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

impl<T> Borrow<T> for T where
T: ?Sized,

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

impl<T> BorrowMut<T> for T where
T: ?Sized,

[src]

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

impl<T, U> Into for T where
U: From<T>,

[src]

pub fn into(self) -> U

Performs the conversion.

[src]

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

[src]

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

[src]

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

[src]

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct traitgraph::algo::traversal::BfsQueueStrategy[−][src]

Trait Implementations

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

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

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

Auto Trait Implementations

impl RefUnwindSafe for BfsQueueStrategy

impl Send for BfsQueueStrategy

impl Sync for BfsQueueStrategy

impl Unpin for BfsQueueStrategy

impl UnwindSafe for BfsQueueStrategy

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

pub fn into(self) -> U

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

pub fn vzip(self) -> V

Struct traitgraph::algo::traversal::BfsQueueStrategy[−][src]

Trait Implementations

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

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

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

Auto Trait Implementations

impl RefUnwindSafe for BfsQueueStrategy

impl Send for BfsQueueStrategy

impl Sync for BfsQueueStrategy

impl Unpin for BfsQueueStrategy

impl UnwindSafe for BfsQueueStrategy

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,