Crate disk_based_bfs

Source
Expand description

Breadth-first search using hard drive space for storing intermediate data.

The implementation is efficient, generic, parallel, and can use multiple hard drives. The algorithm is based on the paper Minimizing Disk I/O in Two-Bit Breadth-First Search of Richard Korf, with various improvements. It is suitable for very large implicit graphs (~10^13 nodes), e.g. the 15 puzzle graph.

Modulesยง

builder
Builder used to define settings for a BFS and run it.
callback
Defines the BfsCallback trait.
expander
Defines the BfsExpander trait.
provider
Defines the BfsSettingsProvider trait and related types.