Docs.rs
algorithms-edu-0.2.7
algorithms-edu 0.2.7
Permalink
Docs.rs crate page
MIT
Links
Repository
crates.io
Source
Owners
TianyiShi2001
Dependencies
disjoint-sets ^0.4.2
normal
kodama ^0.2.3
normal
lazy_static ^1.4.0
normal
num-traits ^0.2.14
normal
ordered-float ^2.0
normal
partial-min-max ^0.4.0
normal
priority-queue ^1.0
normal
rand ^0.7.3
normal
Versions
25.73%
of the crate is documented
Platform
i686-pc-windows-msvc
i686-unknown-linux-gnu
x86_64-apple-darwin
x86_64-pc-windows-msvc
x86_64-unknown-linux-gnu
Feature flags
docs.rs
About docs.rs
Badges
Builds
Metadata
Shorthand URLs
Download
Rustdoc JSON
Build queue
Privacy policy
Rust
Rust website
The Book
Standard Library API Reference
Rust by Example
The Cargo Guide
Clippy Documentation
Module fast_queue
algorithms_
edu
0.2.7
Module fast_
queue
Sections
Breadth First Search (Iterative Implementation)
Module Items
Traits
In algorithms_
edu::
algo::
graph::
bfs
algorithms_edu
::
algo
::
graph
::
bfs
Module
fast_
queue
Copy item path
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
§
BfsReconstruct
Path