Struct DepthFirstSearch

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

Implementations

impl<N: Node> DepthFirstSearch<N>

pub fn new() -> Self

Trait Implementations

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

fn clone(&self) -> DepthFirstSearch<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 DepthFirstSearch<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 DepthFirstSearch<N>

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

Formats the value using the given formatter.

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

fn default() -> DepthFirstSearch<N>

Returns the “default value” for a type.

impl<N: Hash + Node> Hash for DepthFirstSearch<N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: Ord + Node> Ord for DepthFirstSearch<N>

fn cmp(&self, other: &DepthFirstSearch<N>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

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

fn eq(&self, other: &DepthFirstSearch<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: PartialOrd + Node> PartialOrd for DepthFirstSearch<N>

fn partial_cmp(&self, other: &DepthFirstSearch<N>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<N, V> Searcher<N, V> for DepthFirstSearch<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 DepthFirstSearch<N>

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