Disk-based BFS
An implementation of disk-based breadth first search, using a version of the algorithm described in Richard Korf's paper Minimizing Disk I/O in Two-Bit Breadth-First Search modified to only require one bit per state.
- Coverage
- 100%
72 out of 72 items documented0 out of 34 items with examples - Size
- Source code size: 173.52 kB This is the summed size of all the files inside the crates.io package for this release.
- Documentation size: 2.36 MB This is the summed size of all files generated by rustdoc for all configured targets
- Ø build duration
- this release: 42s Average build duration of successful builds.
- all releases: 42s Average build duration of successful builds in releases after 2024-10-23.
- Links
-
benwh1/disk-based-bfs
0 0 0 - crates.io
- Dependencies
-
- bytemuck ^1.18.0 normal
- cityhasher ^0.1.0 normal
- fs4 ^0.12.0 normal
- itertools ^0.14.0 normal
- libc ^0.2.159 normal
- parking_lot ^0.12.3 normal
- rand ^0.8.5 normal
- serde ^1.0.210 normal
- serde_derive ^1.0.210 normal
- serde_json ^1.0.128 normal
- thiserror ^2.0.11 normal
- tracing ^0.1.40 normal
- xxhash-rust ^0.8.12 normal
- zstd ^0.13.2 normal
- Versions
- Owners
-