Struct nannou::geom::graph::node::Dfs

pub struct Dfs<S = Default> where
    S: BaseFloat,  { /* fields omitted */ }

A depth-first-search over nodes in the graph, yielding each node’s unique index alongside its absolute transform.

The traversal may start at any given node.

Note: The algorithm may not behave correctly if nodes are removed during iteration. It may not necessarily visit added nodes or edges.

Implementations

impl<S> Dfs<S> where
    S: BaseFloat, 

pub fn new(graph: &Graph<S>) -> Self

Create a new Dfs starting from the graph’s origin.

pub fn start_from(graph: &Graph<S>, start: Index) -> Self

Create a new Dfs starting from the node at the given node.

pub fn reset(&mut self, graph: &Graph<S>)

Clears the visit state.

pub fn move_to(&mut self, start: Index)

Keep the discovered map but clear the visit stack and restart the dfs from the given node.

pub fn next_transform(
    &mut self,
    graph: &Graph<S>
) -> Option<(Index, Transform<S>)>

Return the tranform for the next node in the DFS.

Returns None if the traversal is finished.

pub fn next_vertices<F, I>(
    &mut self,
    graph: &Graph<S>,
    vertices_fn: F
) -> Option<(Index, TransformedVertices<I::IntoIter, S>)> where
    F: FnOnce(&Index) -> I,
    I: IntoIterator,
    I::Item: ApplyTransform<S>, 

Return the vertices for the next node in the DFS.

Uses Dfs::next_transform internally.

Returns None if the traversal is finished.

pub fn next_triangles<F, I, V>(
    &mut self,
    graph: &Graph<S>,
    triangles_fn: F
) -> Option<(Index, TransformedTriangles<I::IntoIter, V, S>)> where
    F: FnOnce(&Index) -> I,
    I: IntoIterator<Item = Tri<V>>,
    V: Vertex + ApplyTransform<S>, 

Return the triangles for the next node in the DFS.

Uses Dfs::next_transform and Node::triangles internally.

Returns None if the traversal is finished.

Trait Implementations

impl<S: Clone> Clone for Dfs<S> where
    S: BaseFloat, 

fn clone(&self) -> Dfs<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for Dfs<S> where
    S: BaseFloat, 

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

Formats the value using the given formatter.

impl<'a, S> Walker<&'a Graph<S>> for Dfs<S> where
    S: BaseFloat, 

type Item = (Index, Transform<S>)

fn walk_next(&mut self, graph: &'a Graph<S>) -> Option<Self::Item>

Advance to the next item

pub fn iter(self, context: Context) -> WalkerIter<Self, Context> where
    Context: Clone, 

Create an iterator out of the walker and given context.