Struct bevy::utils::petgraph::algo::Matching

impl<G> Matching<G>where G: NodeIndexable,

pub fn mate( &self, node: <G as GraphBase>::NodeId ) -> Option<<G as GraphBase>::NodeId>

Gets the matched counterpart of given node, if there is any.

Returns None if the node is not matched or does not exist.

pub fn edges(&self) -> MatchedEdges<'_, G> ⓘ

Iterates over all edges from the matching.

An edge is represented by its endpoints. The graph is considered undirected and every pair of matched nodes is reported only once.

pub fn nodes(&self) -> MatchedNodes<'_, G> ⓘ

Iterates over all nodes from the matching.

pub fn contains_edge( &self, a: <G as GraphBase>::NodeId, b: <G as GraphBase>::NodeId ) -> bool

Returns true if given edge is in the matching, or false otherwise.

If any of the the nodes does not exist, false is returned.

pub fn contains_node(&self, node: <G as GraphBase>::NodeId) -> bool

Returns true if given node is in the matching, or false otherwise.

If the node does not exist, false is returned.

pub fn len(&self) -> usize

Gets the number of matched edges.

pub fn is_empty(&self) -> bool

Returns true if the number of matched edges is 0.

impl<G> Matching<G>where G: NodeCount,

pub fn is_perfect(&self) -> bool

Returns true if the matching is perfect.

A matching is perfect if every node in the graph is incident to an edge from the matching.

Auto Trait Implementations§

impl<G> RefUnwindSafe for Matching<G>where G: RefUnwindSafe, <G as GraphBase>::NodeId: RefUnwindSafe,

impl<G> UnwindSafe for Matching<G>where G: UnwindSafe, <G as GraphBase>::NodeId: UnwindSafe,

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T, U> AsBindGroupShaderType for Twhere U: ShaderType, &'a T: for<'a> Into,

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> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Downcast<T> for T

fn downcast(&self) -> &T

impl<T> Downcast for Twhere T: Any,

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>

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)

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)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.

impl<T> DowncastSync for Twhere T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.