Struct debris_common::graph::GraphDfs

pub struct GraphDfs {
    to_visit: FxHashSet<usize>,
    iter_order: IndexSet<usize, BuildHasherDefault<FxHasher>>,
}

A struct that implements a non-recursive Depth-first-search on a GraphMatrix. This is a struct in order to save on allocations in hot code. The elements are yielded in post-order, i.e. every node gets only yielded if all of its children are yielded.

Fields

to_visit: FxHashSet<usize>

iter_order: IndexSet<usize, BuildHasherDefault<FxHasher>>

Implementations

impl GraphDfs

pub fn iter<'graph, 'this: 'graph, T>( &'this mut self, graph: &'graph GraphMatrix<T>, root: impl Iterator<Item = usize> ) -> impl Iterator<Item = usize> + 'graph

Trait Implementations

impl Default for GraphDfs

fn default() -> GraphDfs

Returns the “default value” for a type.