Struct petgraph::visit::Reversed
[−]
[src]
pub struct Reversed<G>(pub G);
An edge-reversing graph adaptor.
All edges have the opposite direction with Reversed
.
Trait Implementations
impl<G: Copy> Copy for Reversed<G>
[src]
impl<G: Clone> Clone for Reversed<G>
[src]
fn clone(&self) -> Reversed<G>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<G: Debug> Debug for Reversed<G>
[src]
impl<G: GraphBase> GraphBase for Reversed<G>
[src]
impl<G: GraphRef> GraphRef for Reversed<G>
[src]
impl<G> Data for Reversed<G> where G: Data
[src]
type NodeWeight = G::NodeWeight
type EdgeWeight = G::EdgeWeight
impl<G> IntoNeighbors for Reversed<G> where G: IntoNeighborsDirected
[src]
type Neighbors = G::NeighborsDirected
fn neighbors(self, n: G::NodeId) -> G::NeighborsDirected
Return an iterator of the neighbors of node a
.
impl<G> IntoNeighborsDirected for Reversed<G> where G: IntoNeighborsDirected
[src]
type NeighborsDirected = G::NeighborsDirected
fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected
impl<G: Visitable> Visitable for Reversed<G>
[src]
type Map = G::Map
The associated map type
fn visit_map(&self) -> G::Map
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)
Reset the visitor map (and resize to new size of graph if needed)
impl<G> IntoEdgeReferences for Reversed<G> where G: IntoEdgeReferences
[src]
type EdgeRef = ReversedEdgeReference<G::EdgeRef>
type EdgeReferences = ReversedEdgeReferences<G::EdgeReferences>
fn edge_references(self) -> Self::EdgeReferences
impl<G> NodeIndexable for Reversed<G> where G: NodeIndexable
[src]
fn node_bound(&self) -> usize
Return an upper bound of the node indices in the graph (suitable for the size of a bitmap). Read more
fn to_index(&self, a: Self::NodeId) -> usize
Convert a
to an integer index.
fn from_index(&self, i: usize) -> Self::NodeId
Convert i
to a node index