pub struct Topo<N, VM> { /* private fields */ }
Expand description
A topological order traversal for a graph.
Note that Topo
only visits nodes that are not part of cycles,
i.e. nodes in a true DAG. Use other visitors like DfsPostOrder
or
algorithms like kosaraju_scc to handle graphs with possible cycles.
Implementations§
source§impl<N, VM> Topo<N, VM>where
N: Copy + PartialEq<N>,
VM: VisitMap<N>,
impl<N, VM> Topo<N, VM>where N: Copy + PartialEq<N>, VM: VisitMap<N>,
sourcepub fn new<G>(graph: G) -> Topo<N, VM>where
G: IntoNodeIdentifiers<NodeId = N> + IntoNeighborsDirected + Visitable<Map = VM>,
pub fn new<G>(graph: G) -> Topo<N, VM>where G: IntoNodeIdentifiers<NodeId = N> + IntoNeighborsDirected + Visitable<Map = VM>,
Create a new Topo
, using the graph’s visitor map, and put all
initial nodes in the to visit list.
sourcepub fn reset<G>(&mut self, graph: G)where
G: IntoNodeIdentifiers<NodeId = N> + IntoNeighborsDirected + Visitable<Map = VM>,
pub fn reset<G>(&mut self, graph: G)where G: IntoNodeIdentifiers<NodeId = N> + IntoNeighborsDirected + Visitable<Map = VM>,
Clear visited state, and put all initial nodes in the to visit list.
sourcepub fn next<G>(&mut self, g: G) -> Option<N>where
G: IntoNeighborsDirected<NodeId = N> + Visitable<Map = VM>,
pub fn next<G>(&mut self, g: G) -> Option<N>where G: IntoNeighborsDirected<NodeId = N> + Visitable<Map = VM>,
Return the next node in the current topological order traversal, or
None
if the traversal is at the end.
Note: The graph may not have a complete topological order, and the only way to know is to run the whole traversal and make sure it visits every node.
Trait Implementations§
source§impl<G> Walker<G> for Topo<<G as GraphBase>::NodeId, <G as Visitable>::Map>where
G: IntoNeighborsDirected + Visitable,
impl<G> Walker<G> for Topo<<G as GraphBase>::NodeId, <G as Visitable>::Map>where G: IntoNeighborsDirected + Visitable,
Auto Trait Implementations§
impl<N, VM> RefUnwindSafe for Topo<N, VM>where N: RefUnwindSafe, VM: RefUnwindSafe,
impl<N, VM> Send for Topo<N, VM>where N: Send, VM: Send,
impl<N, VM> Sync for Topo<N, VM>where N: Sync, VM: Sync,
impl<N, VM> Unpin for Topo<N, VM>where N: Unpin, VM: Unpin,
impl<N, VM> UnwindSafe for Topo<N, VM>where N: UnwindSafe, VM: UnwindSafe,
Blanket Implementations§
§impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere U: ShaderType, &'a T: for<'a> Into<U>,
§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.§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§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.§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.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere T: Default,
§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates
Self
using data from the given World