disk-based-bfs
| Crates.io | disk-based-bfs |
| lib.rs | disk-based-bfs |
| version | 0.1.0 |
| created_at | 2024-04-20 19:22:30.828213+00 |
| updated_at | 2025-01-13 11:19:07.384128+00 |
| description | Fast generic implementation of breadth-first search using disk storage, suitable for extremely large implicit graphs. |
| homepage | |
| repository | https://github.com/benwh1/disk-based-bfs |
| max_upload_size | |
| id | 1214824 |
| size | 157,666 |
(benwh1)
documentation
README
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.