Struct petgraph::visit::Reversed

pub struct Reversed<G>(pub G);

An edge-reversing graph adaptor.

All edges have the opposite direction with Reversed.

Tuple Fields

0: G

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<G> Data for Reversed<G>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::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

Formats the value using the given formatter.

impl<G> EdgeCount for Reversed<G>

where G: EdgeCount,

fn edge_count(&self) -> usize

Return the number of edges in the graph.

impl<G> EdgeIndexable for Reversed<G>

where G: EdgeIndexable,

fn edge_bound(&self) -> usize

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

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

Convert a to an integer index.

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

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

impl<G> GetAdjacencyMatrix for Reversed<G>

where G: GetAdjacencyMatrix,

type AdjMatrix = <G as GetAdjacencyMatrix>::AdjMatrix

The associated adjacency matrix type

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

Create the adjacency matrix

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.

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

type NodeId = <G as GraphBase>::NodeId

node identifier

type EdgeId = <G as GraphBase>::EdgeId

edge identifier

impl<G> GraphProp for Reversed<G>

where G: GraphProp,

type EdgeType = <G as GraphProp>::EdgeType

The kind of edges in the graph.

fn is_directed(&self) -> bool

impl<G> IntoEdgeReferences for Reversed<G>

where G: IntoEdgeReferences,

type EdgeRef = ReversedEdgeReference<<G as IntoEdgeReferences>::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<<G as IntoEdgeReferences>::EdgeReferences>

fn edge_references(self) -> Self::EdgeReferences

impl<G> IntoEdges for Reversed<G>

where G: IntoEdgesDirected,

type Edges = ReversedEdges<<G as IntoEdgesDirected>::EdgesDirected>

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

impl<G> IntoEdgesDirected for Reversed<G>

where G: IntoEdgesDirected,

type EdgesDirected = ReversedEdges<<G as IntoEdgesDirected>::EdgesDirected>

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

impl<G> IntoNeighbors for Reversed<G>

where G: IntoNeighborsDirected,

type Neighbors = <G as IntoNeighborsDirected>::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,

type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected

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

impl<G> IntoNodeIdentifiers for Reversed<G>

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

fn node_identifiers(self) -> Self::NodeIdentifiers

impl<G> IntoNodeReferences for Reversed<G>

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::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

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

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. i must be a valid value in the graph.

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

type Map = <G as Visitable>::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: Copy> Copy for Reversed<G>

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

impl<G> NodeCompactIndexable for Reversed<G>

where G: NodeCompactIndexable,