Struct BreadthFirstSearch

pub struct BreadthFirstSearch<N: Node> { /* private fields */ }

Implementations

impl<N: Node> BreadthFirstSearch<N>

pub fn new() -> Self

Trait Implementations

impl<N: Clone + Node> Clone for BreadthFirstSearch<N>

fn clone(&self) -> BreadthFirstSearch<N>

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Node> Contain<N> for BreadthFirstSearch<N>

fn contains(&self, elem: &N) -> bool

Contain::contains returns true if the given element is in the Contain instance

fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_all returns true if all elements in the given iterator are in the Contain instance

fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_some returns true if any element in the given iterator is in the Contain instance

impl<N: Debug + Node> Debug for BreadthFirstSearch<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Default + Node> Default for BreadthFirstSearch<N>

fn default() -> BreadthFirstSearch<N>

Returns the “default value” for a type.

impl<N: PartialEq + Node> PartialEq for BreadthFirstSearch<N>

fn eq(&self, other: &BreadthFirstSearch<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N, V> Searcher<N, V> for BreadthFirstSearch<N>

where N: Node, V: Weight,

fn reset(&mut self)

Reset the search state.

fn search(&mut self, graph: impl Graph<N, V>, start: N) -> Vec<N>

Search the graph for nodes.

impl<N: Eq + Node> Eq for BreadthFirstSearch<N>

impl<N: Node> StructuralPartialEq for BreadthFirstSearch<N>