[−][src]Trait petgraph::visit::NodeCount
A graph with a known node count.
Required methods
fn node_count(&self) -> usize
Implementations on Foreign Types
impl<'a, G> NodeCount for &'a G where
G: NodeCount,
[src]
G: NodeCount,
fn node_count(&self) -> usize
[src]
Implementors
impl<'a, G> NodeCount for Frozen<'a, G> where
G: NodeCount,
[src]
G: NodeCount,
fn node_count(&self) -> usize
[src]
impl<G> NodeCount for Reversed<G> where
G: NodeCount,
[src]
G: NodeCount,
fn node_count(&self) -> usize
[src]
impl<G, F> NodeCount for EdgeFiltered<G, F> where
G: NodeCount,
[src]
G: NodeCount,
fn node_count(&self) -> usize
[src]
impl<N, E, Ty> NodeCount for GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
[src]
N: NodeTrait,
Ty: EdgeType,
fn node_count(&self) -> usize
[src]
impl<N, E, Ty, Ix> NodeCount for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
fn node_count(&self) -> usize
[src]
impl<N, E, Ty, Ix> NodeCount for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
fn node_count(&self) -> usize
[src]
impl<N, E, Ty, Ix> NodeCount for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,