Struct petgraph::visit::AsUndirected

pub struct AsUndirected<G>(pub G);

Wrapper type for walking the graph as if it is undirected

Trait Implementations

impl<G: Copy> Copy for AsUndirected<G>

impl<G: Clone> Clone for AsUndirected<G>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'b, N, E, Ty, Ix> IntoNeighbors for AsUndirected<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType

type Neighbors = Neighbors<'b, E, Ix>

fn neighbors(self, n: NodeIndex<Ix>) -> Neighbors<'b, E, Ix>

Return an iterator of the neighbors of node a.

impl<G: GraphBase> GraphBase for AsUndirected<G>

type NodeId = G::NodeId

node identifier

type EdgeId = G::EdgeId

edge identifier

impl<G: GraphRef> GraphRef for AsUndirected<G>

impl<G: Visitable> Visitable for AsUndirected<G>

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)