Parallel Best-First Search

PBeFS is a C++20 library for the sequential and parallel best-first search of an implicit state-space graph (A*) and of a tree with an incumbent (branch-and-bound), on C++ threads, OpenMP, FastFlow and MPI.

Getting started

• Parallel Best-First Search
• Building and using the library

User guide

• The search problem
• The algorithms
• Branch-and-bound
• Best-first search with an incumbent: design note
• The data structures
• The examples and the benchmark
• Testing
• References

Theory

• Best-first search and A*
• Parallel A*
• Pattern databases
• Branch-and-bound as best-first search
• Parallel branch-and-bound

API reference

• API reference

Project

• Release notes