Trait 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

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

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: IndexType> NodeCount for List<E, Ix>

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

where G: NodeCount,

impl<G: Visitable + NodeCount> NodeCount for Acyclic<G>

impl<G> NodeCount for Reversed<G>

where G: NodeCount,

impl<G> NodeCount for UndirectedAdaptor<G>

where G: NodeCount,

impl<N, E, S: BuildHasher, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> NodeCount for MatrixGraph<N, E, S, Ty, Null, Ix>

impl<N, E, Ty, Ix> NodeCount for Csr<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, Ix> NodeCount for StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

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

where N: NodeTrait, Ty: EdgeType, S: BuildHasher,