Docs.rs
petgraph-0.6.2
petgraph 0.6.2
Docs.rs crate page
MIT/Apache-2.0
Links
Documentation
Repository
Crates.io
Source
Owners
bluss
github:petgraph:release-team
ABorgna
Dependencies
fixedbitset ^0.4.0
normal
indexmap ^1.7
normal
quickcheck ^0.8
normal
serde ^1.0
normal
serde_derive ^1.0
normal
bincode ^1.3.3
dev
defmac ^0.2.1
dev
itertools ^0.10.1
dev
odds ^0.4.0
dev
rand ^0.5.5
dev
Versions
79%
of the crate is documented
Go to latest version
Platform
i686-pc-windows-msvc
i686-unknown-linux-gnu
x86_64-apple-darwin
x86_64-pc-windows-msvc
x86_64-unknown-linux-gnu
Feature flags
Rust
About docs.rs
Privacy policy
Rust website
The Book
Standard Library API Reference
Rust by Example
The Cargo Guide
Clippy Documentation
☰
NodeCount
Required Methods
node_count
Implementations on Foreign Types
&'a G
Implementors
In petgraph::visit
?
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>