[−][src]Module algorithms_edu::algo::graph::bfs::iterative_fast_queue
Breadth First Search (Iterative Implementation)
This implementation does not track the depth, and thus can make use of the faster fixed size queue.
- Time Complexity: O(V + E)
Resources
Traits
BfsReconstructPath |