Trait petgraph::visit::IntoNodeIdentifiers [−][src]
pub trait IntoNodeIdentifiers: GraphRef { type NodeIdentifiers: Iterator<Item = Self::NodeId>; fn node_identifiers(self) -> Self::NodeIdentifiers; }
Access to the sequence of the graph’s NodeIds.
Associated Types
type NodeIdentifiers: Iterator<Item = Self::NodeId>[src]
Required methods
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
Implementations on Foreign Types
impl<'a, G> IntoNodeIdentifiers for &'a G where
G: IntoNodeIdentifiers, [src]
impl<'a, G> IntoNodeIdentifiers for &'a G where
G: IntoNodeIdentifiers, [src]type NodeIdentifiers = G::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
Implementors
impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G> where
G: IntoNodeIdentifiers, [src]
impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G> where
G: IntoNodeIdentifiers, [src]type NodeIdentifiers = G::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F> where
G: IntoNodeIdentifiers, [src]
impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F> where
G: IntoNodeIdentifiers, [src]type NodeIdentifiers = G::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F> where
G: IntoNodeIdentifiers,
F: FilterNode<G::NodeId>, [src]
impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F> where
G: IntoNodeIdentifiers,
F: FilterNode<G::NodeId>, [src]type NodeIdentifiers = NodeFilteredNeighbors<'a, G::NodeIdentifiers, F>
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]
impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]type NodeIdentifiers = NodeIdentifiers<Ix>
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, N, E: 'a, Ty> IntoNodeIdentifiers for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType, [src]
impl<'a, N, E: 'a, Ty> IntoNodeIdentifiers for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType, [src]type NodeIdentifiers = NodeIdentifiers<'a, N, E, Ty>
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, N, E: 'a, Ty, Ix> IntoNodeIdentifiers for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]
impl<'a, N, E: 'a, Ty, Ix> IntoNodeIdentifiers for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]type NodeIdentifiers = NodeIndices<Ix>
fn node_identifiers(self) -> NodeIndices<Ix>ⓘNotable traits for NodeIndices<Ix>
impl<Ix: IndexType> Iterator for NodeIndices<Ix> type Item = NodeIndex<Ix>;[src]
Notable traits for NodeIndices<Ix>
impl<Ix: IndexType> Iterator for NodeIndices<Ix> type Item = NodeIndex<Ix>;impl<'a, N, E: 'a, Ty, Ix> IntoNodeIdentifiers for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]
impl<'a, N, E: 'a, Ty, Ix> IntoNodeIdentifiers for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]type NodeIdentifiers = NodeIndices<'a, N, Ix>
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<'a, N, E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoNodeIdentifiers for &'a MatrixGraph<N, E, Ty, Null, Ix>[src]
impl<'a, N, E: 'a, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoNodeIdentifiers for &'a MatrixGraph<N, E, Ty, Null, Ix>[src]type NodeIdentifiers = NodeIdentifiers<'a, Ix>
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<G> IntoNodeIdentifiers for Reversed<G> where
G: IntoNodeIdentifiers, [src]
impl<G> IntoNodeIdentifiers for Reversed<G> where
G: IntoNodeIdentifiers, [src]