Trait petgraph::visit::NodeCount

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

A graph with a known node count.

Required Methods

fn node_count(&self) -> usize

Implementations on Foreign Types

impl<'a, G> NodeCount for &'a Gwhere
    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> 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 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: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> NodeCount for MatrixGraph<N, E, Ty, Null, Ix>

impl<N, E, Ty> NodeCount for FastGraphMap<N, E, Ty>where
    N: Copy + PartialEq,