Struct daggy::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, Ty, Ix> NeighborIter<'a> for AsUndirected<&'b Graph<N, E, Ty, Ix>> where E: 'a, Ix: IndexType, Ty: EdgeType

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

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

Return an iterator that visits all neighbors of the node n.

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

type NodeId = G::NodeId

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

type Map = G::Map

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