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>[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)1.0.0[src]
Performs copy-assignment from source. Read more
impl<G: Debug> Debug for Reversed<G>[src]
fn fmt(&self, __arg_0: &mut Formatter) -> Result[src]
Formats the value using the given formatter. Read more
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]
G: Data,
type NodeWeight = G::NodeWeight
type EdgeWeight = G::EdgeWeight
impl<G> IntoNeighbors for Reversed<G> where
G: IntoNeighborsDirected, [src]
G: IntoNeighborsDirected,
type Neighbors = G::NeighborsDirected
fn neighbors(self, n: G::NodeId) -> G::NeighborsDirected[src]
Return an iterator of the neighbors of node a.
impl<G> IntoNeighborsDirected for Reversed<G> where
G: IntoNeighborsDirected, [src]
G: IntoNeighborsDirected,
type NeighborsDirected = G::NeighborsDirected
fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected[src]
impl<G: Visitable> Visitable for Reversed<G>[src]
type Map = G::Map
The associated map type
fn visit_map(&self) -> G::Map[src]
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)[src]
Reset the visitor map (and resize to new size of graph if needed)
impl<G> IntoEdgeReferences for Reversed<G> where
G: IntoEdgeReferences, [src]
G: IntoEdgeReferences,
type EdgeRef = ReversedEdgeReference<G::EdgeRef>
type EdgeReferences = ReversedEdgeReferences<G::EdgeReferences>
fn edge_references(self) -> Self::EdgeReferences[src]
impl<G> NodeIndexable for Reversed<G> where
G: NodeIndexable, [src]
G: NodeIndexable,
fn node_bound(&self) -> usize[src]
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[src]
Convert a to an integer index.
fn from_index(&self, i: usize) -> Self::NodeId[src]
Convert i to a node index
impl<G> NodeCompactIndexable for Reversed<G> where
G: NodeCompactIndexable, [src]
G: NodeCompactIndexable,
impl<G> IntoNodeIdentifiers for Reversed<G> where
G: IntoNodeIdentifiers, [src]
G: IntoNodeIdentifiers,
type NodeIdentifiers = G::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers[src]
impl<G> IntoNodeReferences for Reversed<G> where
G: IntoNodeReferences, [src]
G: IntoNodeReferences,
type NodeRef = G::NodeRef
type NodeReferences = G::NodeReferences
fn node_references(self) -> Self::NodeReferences[src]
impl<G> GraphProp for Reversed<G> where
G: GraphProp, [src]
G: GraphProp,
impl<G> NodeCount for Reversed<G> where
G: NodeCount, [src]
G: NodeCount,
fn node_count(&self) -> usize[src]
impl<G> DataMap for Reversed<G> where
G: DataMap, [src]
G: DataMap,
fn node_weight(&self, id: Self::NodeId) -> Option<&Self::NodeWeight>[src]
fn edge_weight(&self, id: Self::EdgeId) -> Option<&Self::EdgeWeight>[src]
impl<G> DataMapMut for Reversed<G> where
G: DataMapMut, [src]
G: DataMapMut,