☰
NodeCount
NodeCount
Required Methods
node_count
Implementations on Foreign Types
&'a G
Implementors
In petgraph::visit
Structs
Bfs
Dfs
DfsPostOrder
EdgeFiltered
EdgeFilteredEdges
EdgeFilteredNeighbors
EdgeFilteredNeighborsDirected
NodeFiltered
NodeFilteredEdgeReferences
NodeFilteredEdges
NodeFilteredNeighbors
NodeFilteredNodes
Reversed
ReversedEdgeReference
ReversedEdgeReferences
ReversedEdges
Time
Topo
WalkerIter
Enums
Control
DfsEvent
Traits
ControlFlow
Data
EdgeCount
EdgeIndexable
EdgeRef
FilterEdge
FilterNode
GetAdjacencyMatrix
GraphBase
GraphProp
GraphRef
IntoEdgeReferences
IntoEdges
IntoEdgesDirected
IntoNeighbors
IntoNeighborsDirected
IntoNodeIdentifiers
IntoNodeReferences
NodeCompactIndexable
NodeCount
NodeIndexable
NodeRef
VisitMap
Visitable
Walker
Functions
depth_first_search
?
Trait
petgraph
::
visit
::
NodeCount
source
·
[
−
]
pub trait NodeCount:
GraphBase
{ fn
node_count
(&self) ->
usize
; }
Expand description
A graph with a known node count.
Required Methods
§
source
fn
node_count
(&self) ->
usize
Implementations on Foreign Types
§
source
§
impl<'a, G>
NodeCount
for
&'a
G
where
G:
NodeCount
,
source
§
fn
node_count
(&self) ->
usize
Implementors
§
source
§
impl<'a, G>
NodeCount
for
Frozen
<'a, G>
where
G:
NodeCount
,
source
§
impl<E, Ix:
IndexType
>
NodeCount
for
List
<E, Ix>
source
§
impl<G>
NodeCount
for
Reversed
<G>
where
G:
NodeCount
,
source
§
impl<G, F>
NodeCount
for
EdgeFiltered
<G, F>
where
G:
NodeCount
,
source
§
impl<N, E, Ty>
NodeCount
for
GraphMap
<N, E, Ty>
where
N:
NodeTrait
,
Ty:
EdgeType
,
source
§
impl<N, E, Ty, Ix>
NodeCount
for
Csr
<N, E, Ty, Ix>
where
Ty:
EdgeType
,
Ix:
IndexType
,
source
§
impl<N, E, Ty, Ix>
NodeCount
for
Graph
<N, E, Ty, Ix>
where
Ty:
EdgeType
,
Ix:
IndexType
,
source
§
impl<N, E, Ty, Ix>
NodeCount
for
StableGraph
<N, E, Ty, Ix>
where
Ty:
EdgeType
,
Ix:
IndexType
,
source
§
impl<N, E, Ty:
EdgeType
, Null:
Nullable
<Wrapped = E>, Ix:
IndexType
>
NodeCount
for
MatrixGraph
<N, E, Ty, Null, Ix>