Struct bevy_internal::utils::petgraph::prelude::DfsPostOrder
source · pub struct DfsPostOrder<N, VM> {
pub stack: Vec<N>,
pub discovered: VM,
pub finished: VM,
}
Expand description
Visit nodes in a depth-first-search (DFS) emitting nodes in postorder (each node after all its descendants have been emitted).
DfsPostOrder
is not recursive.
The traversal starts at a given node and only traverses nodes reachable from it.
Fields§
§stack: Vec<N>
The stack of nodes to visit
discovered: VM
The map of discovered nodes
finished: VM
The map of finished nodes
Implementations§
source§impl<N, VM> DfsPostOrder<N, VM>
impl<N, VM> DfsPostOrder<N, VM>
sourcepub fn new<G>(graph: G, start: N) -> DfsPostOrder<N, VM>
pub fn new<G>(graph: G, start: N) -> DfsPostOrder<N, VM>
Create a new DfsPostOrder
using the graph’s visitor map, and put
start
in the stack of nodes to visit.
sourcepub fn empty<G>(graph: G) -> DfsPostOrder<N, VM>
pub fn empty<G>(graph: G) -> DfsPostOrder<N, VM>
Create a new DfsPostOrder
using the graph’s visitor map, and no stack.
sourcepub fn move_to(&mut self, start: N)
pub fn move_to(&mut self, start: N)
Keep the discovered and finished map, but clear the visit stack and restart the dfs from a particular node.
sourcepub fn next<G>(&mut self, graph: G) -> Option<N>where
G: IntoNeighbors<NodeId = N>,
pub fn next<G>(&mut self, graph: G) -> Option<N>where
G: IntoNeighbors<NodeId = N>,
Return the next node in the traversal, or None
if the traversal is done.
Trait Implementations§
source§impl<N, VM> Clone for DfsPostOrder<N, VM>
impl<N, VM> Clone for DfsPostOrder<N, VM>
source§fn clone(&self) -> DfsPostOrder<N, VM>
fn clone(&self) -> DfsPostOrder<N, VM>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<N, VM> Debug for DfsPostOrder<N, VM>
impl<N, VM> Debug for DfsPostOrder<N, VM>
source§impl<N, VM> Default for DfsPostOrder<N, VM>where
VM: Default,
impl<N, VM> Default for DfsPostOrder<N, VM>where
VM: Default,
source§fn default() -> DfsPostOrder<N, VM>
fn default() -> DfsPostOrder<N, VM>
Returns the “default value” for a type. Read more
source§impl<G> Walker<G> for DfsPostOrder<<G as GraphBase>::NodeId, <G as Visitable>::Map>where
G: IntoNeighbors + Visitable,
impl<G> Walker<G> for DfsPostOrder<<G as GraphBase>::NodeId, <G as Visitable>::Map>where
G: IntoNeighbors + Visitable,
Auto Trait Implementations§
impl<N, VM> RefUnwindSafe for DfsPostOrder<N, VM>where
N: RefUnwindSafe,
VM: RefUnwindSafe,
impl<N, VM> Send for DfsPostOrder<N, VM>
impl<N, VM> Sync for DfsPostOrder<N, VM>
impl<N, VM> Unpin for DfsPostOrder<N, VM>
impl<N, VM> UnwindSafe for DfsPostOrder<N, VM>where
N: UnwindSafe,
VM: UnwindSafe,
Blanket Implementations§
source§impl<T, U> AsBindGroupShaderType<U> for T
impl<T, U> AsBindGroupShaderType<U> for T
source§fn as_bind_group_shader_type(&self, _images: &RenderAssets<Image>) -> U
fn as_bind_group_shader_type(&self, _images: &RenderAssets<Image>) -> U
Return the
T
ShaderType
for self
. When used in AsBindGroup
derives, it is safe to assume that all images in self
exist.source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
source§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
source§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
source§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates
Self
using data from the given World
.