Struct petgraph::visit::Reversed

source · [−]

pub struct Reversed<G>(pub G);

Expand description

An edge-reversing graph adaptor.

All edges have the opposite direction with Reversed.

Tuple Fields

0: G

Trait Implementations

source

impl<G: Clone> Clone for Reversed<G>

source

fn clone(&self) -> Reversed<G>

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl<G> Data for Reversed<G> where
G: Data,

type NodeWeight = G::NodeWeight

fn node_weight_mut(&mut self, id: Self::NodeId) -> Option<&mut Self::NodeWeight>

source

fn edge_weight_mut(&mut self, id: Self::EdgeId) -> Option<&mut Self::EdgeWeight>

source

impl<G: Debug> Debug for Reversed<G>

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl<G> EdgeCount for Reversed<G> where
G: EdgeCount,

source

fn edge_count(&self) -> usize

Return the number of edges in the graph.

source

impl<G> EdgeIndexable for Reversed<G> where
G: EdgeIndexable,

source

fn edge_bound(&self) -> usize

Return an upper bound of the edge indices in the graph (suitable for the size of a bitmap). Read more

source

fn to_index(&self, a: Self::EdgeId) -> usize

Convert a to an integer index.

source

fn from_index(&self, i: usize) -> Self::EdgeId

Convert i to an edge index. i must be a valid value in the graph.

source

impl<G> GetAdjacencyMatrix for Reversed<G> where
G: GetAdjacencyMatrix,

type AdjMatrix = G::AdjMatrix

The associated adjacency matrix type

source

fn adjacency_matrix(&self) -> Self::AdjMatrix

Create the adjacency matrix

source

fn is_adjacent(
    &self,
    matrix: &Self::AdjMatrix,
    a: Self::NodeId,
    b: Self::NodeId
) -> bool

Return true if there is an edge from a to b, false otherwise. Read more

source

impl<G: GraphBase> GraphBase for Reversed<G>

type NodeId = G::NodeId

node identifier

type EdgeId = G::EdgeId

edge identifier

source

impl<G> GraphProp for Reversed<G> where
G: GraphProp,

type EdgeType = G::EdgeType

The kind edges in the graph.

source

fn is_directed(&self) -> bool

source

impl<G> IntoEdgeReferences for Reversed<G> where
G: IntoEdgeReferences,

type EdgeRef = ReversedEdgeReference<G::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<G::EdgeReferences>

source

fn edge_references(self) -> Self::EdgeReferences

source

impl<G> IntoEdges for Reversed<G> where
G: IntoEdgesDirected,

type Edges = ReversedEdges<G::EdgesDirected>

source

fn edges(self, a: Self::NodeId) -> Self::Edges

source

impl<G> IntoEdgesDirected for Reversed<G> where
G: IntoEdgesDirected,

type EdgesDirected = ReversedEdges<G::EdgesDirected>

source

fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::Edges

source

impl<G> IntoNeighbors for Reversed<G> where
G: IntoNeighborsDirected,

type Neighbors = G::NeighborsDirected

source

fn neighbors(self, n: G::NodeId) -> G::NeighborsDirected

Return an iterator of the neighbors of node a.

source

impl<G> IntoNeighborsDirected for Reversed<G> where
G: IntoNeighborsDirected,

type NeighborsDirected = G::NeighborsDirected

source

fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected

source

impl<G> IntoNodeIdentifiers for Reversed<G> where
G: IntoNodeIdentifiers,

type NodeIdentifiers = G::NodeIdentifiers

source

fn node_identifiers(self) -> Self::NodeIdentifiers

source

impl<G> IntoNodeReferences for Reversed<G> where
G: IntoNodeReferences,

type NodeRef = G::NodeRef

type NodeReferences = G::NodeReferences

source

fn node_references(self) -> Self::NodeReferences

source

impl<G> NodeCount for Reversed<G> where
G: NodeCount,

source

fn node_count(&self) -> usize

source

impl<G> NodeIndexable for Reversed<G> where
G: NodeIndexable,

source

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

source

fn to_index(&self, a: Self::NodeId) -> usize

Convert a to an integer index.

source

fn from_index(&self, i: usize) -> Self::NodeId

Convert i to a node index. i must be a valid value in the graph.

source

impl<G: Visitable> Visitable for Reversed<G>

type Map = G::Map

The associated map type

source

fn visit_map(&self) -> G::Map

Create a new visitor map

source

fn reset_map(&self, map: &mut Self::Map)

Reset the visitor map (and resize to new size of graph if needed)

source

impl<G: Copy> Copy for Reversed<G>

source

impl<G: GraphRef> GraphRef for Reversed<G>

source

impl<G> NodeCompactIndexable for Reversed<G> where
G: NodeCompactIndexable,

Auto Trait Implementations

impl<G> RefUnwindSafe for Reversed<G> where
G: RefUnwindSafe,

impl<G> Send for Reversed<G> where
G: Send,

impl<G> Sync for Reversed<G> where
G: Sync,

impl<G> Unpin for Reversed<G> where
G: Unpin,

impl<G> UnwindSafe for Reversed<G> where
G: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct petgraph::visit::Reversed

Tuple Fields

Trait Implementations

impl<G: Clone> Clone for Reversed<G>

fn clone(&self) -> Reversed<G>

fn clone_from(&mut self, source: &Self)

impl<G> Data for Reversed<G> where G: Data,

type NodeWeight = G::NodeWeight

type EdgeWeight = G::EdgeWeight

impl<G> DataMap for Reversed<G> where G: DataMap,

fn node_weight(&self, id: Self::NodeId) -> Option<&Self::NodeWeight>

fn edge_weight(&self, id: Self::EdgeId) -> Option<&Self::EdgeWeight>

impl<G> DataMapMut for Reversed<G> where G: DataMapMut,

fn node_weight_mut(&mut self, id: Self::NodeId) -> Option<&mut Self::NodeWeight>

fn edge_weight_mut(&mut self, id: Self::EdgeId) -> Option<&mut Self::EdgeWeight>

impl<G: Debug> Debug for Reversed<G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<G> EdgeCount for Reversed<G> where G: EdgeCount,

fn edge_count(&self) -> usize

impl<G> EdgeIndexable for Reversed<G> where G: EdgeIndexable,

fn edge_bound(&self) -> usize

fn to_index(&self, a: Self::EdgeId) -> usize

fn from_index(&self, i: usize) -> Self::EdgeId

impl<G> GetAdjacencyMatrix for Reversed<G> where G: GetAdjacencyMatrix,

type AdjMatrix = G::AdjMatrix

fn adjacency_matrix(&self) -> Self::AdjMatrix

fn is_adjacent( &self, matrix: &Self::AdjMatrix, a: Self::NodeId, b: Self::NodeId) -> bool

impl<G: GraphBase> GraphBase for Reversed<G>

type NodeId = G::NodeId

type EdgeId = G::EdgeId

impl<G> GraphProp for Reversed<G> where G: GraphProp,

type EdgeType = G::EdgeType

fn is_directed(&self) -> bool

impl<G> IntoEdgeReferences for Reversed<G> where G: IntoEdgeReferences,

type EdgeRef = ReversedEdgeReference<G::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<G::EdgeReferences>

fn edge_references(self) -> Self::EdgeReferences

impl<G> IntoEdges for Reversed<G> where G: IntoEdgesDirected,

type Edges = ReversedEdges<G::EdgesDirected>

fn edges(self, a: Self::NodeId) -> Self::Edges

impl<G> IntoEdgesDirected for Reversed<G> where G: IntoEdgesDirected,

type EdgesDirected = ReversedEdges<G::EdgesDirected>

fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::Edges

impl<G> IntoNeighbors for Reversed<G> where G: IntoNeighborsDirected,

type Neighbors = G::NeighborsDirected

fn neighbors(self, n: G::NodeId) -> G::NeighborsDirected

impl<G> IntoNeighborsDirected for Reversed<G> where G: IntoNeighborsDirected,

type NeighborsDirected = G::NeighborsDirected

fn neighbors_directed(self, n: G::NodeId, d: Direction) -> G::NeighborsDirected

impl<G> IntoNodeIdentifiers for Reversed<G> where G: IntoNodeIdentifiers,

type NodeIdentifiers = G::NodeIdentifiers

fn node_identifiers(self) -> Self::NodeIdentifiers

impl<G> IntoNodeReferences for Reversed<G> where G: IntoNodeReferences,

type NodeRef = G::NodeRef

type NodeReferences = G::NodeReferences

fn node_references(self) -> Self::NodeReferences

impl<G> NodeCount for Reversed<G> where G: NodeCount,

fn node_count(&self) -> usize

impl<G> NodeIndexable for Reversed<G> where G: NodeIndexable,

fn node_bound(&self) -> usize

fn to_index(&self, a: Self::NodeId) -> usize

fn from_index(&self, i: usize) -> Self::NodeId

impl<G: Visitable> Visitable for Reversed<G>

type Map = G::Map

fn visit_map(&self) -> G::Map

fn reset_map(&self, map: &mut Self::Map)

impl<G: Copy> Copy for Reversed<G>

impl<G: GraphRef> GraphRef for Reversed<G>

impl<G> NodeCompactIndexable for Reversed<G> where G: NodeCompactIndexable,

Auto Trait Implementations

impl<G> RefUnwindSafe for Reversed<G> where G: RefUnwindSafe,

impl<G> Send for Reversed<G> where G: Send,

impl<G> Sync for Reversed<G> where G: Sync,

impl<G> Unpin for Reversed<G> where G: Unpin,

impl<G> UnwindSafe for Reversed<G> where G: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<G> Data for Reversed<G> where
G: Data,

impl<G> DataMap for Reversed<G> where
G: DataMap,

impl<G> DataMapMut for Reversed<G> where
G: DataMapMut,

impl<G> EdgeCount for Reversed<G> where
G: EdgeCount,

impl<G> EdgeIndexable for Reversed<G> where
G: EdgeIndexable,

impl<G> GetAdjacencyMatrix for Reversed<G> where
G: GetAdjacencyMatrix,

fn is_adjacent(
&self,
matrix: &Self::AdjMatrix,
a: Self::NodeId,
b: Self::NodeId
) -> bool

impl<G> GraphProp for Reversed<G> where
G: GraphProp,

impl<G> IntoEdgeReferences for Reversed<G> where
G: IntoEdgeReferences,

impl<G> IntoEdges for Reversed<G> where
G: IntoEdgesDirected,

impl<G> IntoEdgesDirected for Reversed<G> where
G: IntoEdgesDirected,

impl<G> IntoNeighbors for Reversed<G> where
G: IntoNeighborsDirected,

impl<G> IntoNeighborsDirected for Reversed<G> where
G: IntoNeighborsDirected,

impl<G> IntoNodeIdentifiers for Reversed<G> where
G: IntoNodeIdentifiers,

impl<G> IntoNodeReferences for Reversed<G> where
G: IntoNodeReferences,

impl<G> NodeCount for Reversed<G> where
G: NodeCount,

impl<G> NodeIndexable for Reversed<G> where
G: NodeIndexable,

impl<G> NodeCompactIndexable for Reversed<G> where
G: NodeCompactIndexable,

impl<G> RefUnwindSafe for Reversed<G> where
G: RefUnwindSafe,

impl<G> Send for Reversed<G> where
G: Send,

impl<G> Sync for Reversed<G> where
G: Sync,

impl<G> Unpin for Reversed<G> where
G: Unpin,

impl<G> UnwindSafe for Reversed<G> where
G: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,