disk-based-bfs 0.1.0

Fast generic implementation of breadth-first search using disk storage, suitable for extremely large implicit graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10

//! Defines the `BfsCallback` trait.

/// Defines callback functions that run during the BFS.
pub trait BfsCallback {
    /// Called when a new node is visited.
    fn new_state(&mut self, depth: usize, state: u64);

    /// Called when a chunk of the bit array has finished processing.
    fn end_of_chunk(&self, depth: usize, chunk_idx: usize);
}