algorithms_edu::algo::graph::bfs

Module fast_queue

Source
Expand description

§Breadth First Search (Iterative Implementation)

This implementation does not track the depth, and thus can make use of the faster fixed size queue.

Traits§

BfsReconstructPath