pub type PreOrderUndirectedDfs<'a, Graph> = PreOrderTraversal<'a, Graph, UndirectedNeighborStrategy, DfsQueueStrategy, VecDeque<<Graph as GraphBase>::NodeIndex>>;
Expand description
A DFS that treats each directed edge as an undirected edge, i.e. that traverses edge both in forward and backward direction.
Aliased Typeยง
struct PreOrderUndirectedDfs<'a, Graph> { /* private fields */ }