Trait petgraph::visit::IntoNodeReferences
[−]
[src]
pub trait IntoNodeReferences: Data + IntoNodeIdentifiers { type NodeRef: NodeRef<NodeId=Self::NodeId, Weight=Self::NodeWeight>; type NodeReferences: Iterator<Item=Self::NodeRef>; fn node_references(self) -> Self::NodeReferences; }
Access to the sequence of the graph’s nodes
Associated Types
type NodeRef: NodeRef<NodeId=Self::NodeId, Weight=Self::NodeWeight>
type NodeReferences: Iterator<Item=Self::NodeRef>
Required Methods
fn node_references(self) -> Self::NodeReferences
Implementors
impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F> where G: IntoNodeReferences, F: FilterNode<G::NodeId>
impl<'a, G, F> IntoNodeReferences for &'a EdgeFiltered<G, F> where G: IntoNodeReferences
impl<G> IntoNodeReferences for Reversed<G> where G: IntoNodeReferences
impl<'a, G> IntoNodeReferences for &'a G where G: IntoNodeReferences
impl<'a, N, E, Ty> IntoNodeReferences for &'a GraphMap<N, E, Ty> where N: NodeTrait, Ty: EdgeType
impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
impl<'a, 'b, G> IntoNodeReferences for &'b Frozen<'a, G> where G: IntoNodeReferences