Struct petgraph::visit::AsUndirected

pub struct AsUndirected<G>(pub G);

Wrapper type for walking the graph as if it is undirected

Trait Implementations

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

type Iter = Neighbors<'a, E, Ix>

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

impl<'a, G: Graphlike> Graphlike for AsUndirected<&'a G>

type NodeId = G::NodeId

impl<'a, G: Visitable> Visitable for AsUndirected<&'a G>

type Map = G::Map

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