Trait structures::map::traversable::GraphCollectionTraverser

source · 
pub trait GraphCollectionTraverser<K>: RevTraverser<K>
where
    K: PartialEq + PartialOrd + Clone + Debug,
{
    // Required methods
    fn bfs(&mut self);
    fn bfs_all(&mut self);
    fn dfs(&mut self);
    fn dfs_all(&mut self);
}

Required Methods§

source

fn bfs(&mut self)

Sets the ‘graph traversal mode’ of this ‘graph collection traverser’ to follow breadth first traversal.

source

fn bfs_all(&mut self)

Sets the ‘graph traversal mode’ of this ‘graph collection traverser’ to follow breadth first traversal for all ‘nodes’, meaning it will traverse disconnected ‘nodes’.

source

fn dfs(&mut self)

Sets the ‘graph traversal mode’ of this ‘graph collection traverser’ to follow depth first traversal.

source

fn dfs_all(&mut self)

Sets the ‘graph traversal mode’ of this ‘graph collection traverser’ to follow depth first traversal for all ‘nodes’, meaning it will traverse disconnected ‘nodes’.

Implementors§

source§

impl<V, const DIRECTED: bool, const WEIGHTED: bool> GraphCollectionTraverser<usize> for GraphTraverser<V, DIRECTED, WEIGHTED>
where V: PartialEq + PartialOrd + Clone + Debug,