Struct petgraph::visit::AsUndirected
[−]
[src]
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,
[src]
Ty: EdgeType,
Ix: IndexType,
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.