Trait bevy_internal::utils::petgraph::visit::NodeCount

pub trait NodeCount: GraphBase {
    // Required method
    fn node_count(&self) -> usize;
}

A graph with a known node count.

Required Methods

fn node_count(&self) -> usize

Object Safety

This trait is not object safe.

Implementations on Foreign Types

impl<'a, G> NodeCount for &'a G

where G: NodeCount,

fn node_count(&self) -> usize

Implementors

impl<'a, G> NodeCount for Frozen<'a, G>

where G: NodeCount,

impl<E, Ix> NodeCount for List<E, Ix>

where Ix: IndexType,

impl<G> NodeCount for Reversed<G>

where G: NodeCount,

impl<G, F> NodeCount for EdgeFiltered<G, F>

where G: NodeCount,

impl<N, E, Ty> NodeCount for GraphMap<N, E, Ty>

where N: NodeTrait, Ty: EdgeType,

impl<N, E, Ty, Ix> NodeCount for Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, Ix> NodeCount for StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, Ix> NodeCount for Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

impl<N, E, Ty, Null, Ix> NodeCount for MatrixGraph<N, E, Ty, Null, Ix>

where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,