Skip to main content

GraphCollapseExt

Trait GraphCollapseExt 

Source
pub trait GraphCollapseExt<T: EdgeWeight> {
    // Required method
    fn bounded_even_breadth_first_search_iter<'a>(
        &'a self,
        start_node: NodeIdx,
        bound: Option<usize>,
        scratch: &'a mut (VecDeque<(NodeIdx, usize)>, HashSet<NodeIdx>),
    ) -> impl Iterator<Item = (NodeIdx, usize)> + 'a;
}

Required Methods§

Source

fn bounded_even_breadth_first_search_iter<'a>( &'a self, start_node: NodeIdx, bound: Option<usize>, scratch: &'a mut (VecDeque<(NodeIdx, usize)>, HashSet<NodeIdx>), ) -> impl Iterator<Item = (NodeIdx, usize)> + 'a

Yields each node at a positive even distance from start_node as (node, hops), nearest first.

scratch holds the queue and visited set, so callers can reuse their allocations across searches. It is cleared on entry.

Dyn Compatibility§

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors§