Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

NPBeFS_di_unipi_it	Namespace for the Parallel Best-First Search library
CAStar	Sequential A* over a Domain, with the OPEN list Open
CDDDOptions	Options of DDDAStar, besides those of all the searches
CDDDAStar	A* search of a Domain with delayed duplicate detection on the disk
CZobristDistribution	HDA*[Z]: Zobrist hashing of the features of the state
CAbstractZobristDistribution	HDA[Z,Afeature]: Zobrist hashing of the abstract features (AZHDA)
CAbstractStateDistribution	HDA[Z,Astate]: the abstract state of the Domain, hashed (AHDA)
CPerfectHashDistribution	HDA*[P]: the perfect hash of the Domain modulo p
CStateHashDistribution	Hash of the closed list, remixed with a seed
CRandomDistribution	Random worker for each generated state
COperatorOf	Operator that generated a state, kept in a message [see OperatorDomain]; an empty type, with op always no_op, when D is not an OperatorDomain, so that a message with [[no_unique_address]] on it does not grow
COperatorOf< D >
CExplicitGraph	Weighted graph given explicitly, searched from a source to a target
CFarmAStar	Master-worker parallel A* on a farm with feedback
CGridMap	Rectangular map of cells, each with a cost of traversal
CGrid	Pathfinding on a GridMap with 4 (Moves == 4) or 8 (Moves == 8) moves
CParallelOptions	Options of the parallel searches: those of the sequential search, and the parameters of the parallel ones [see ParallelParams], with batches of 64 nodes flushed every 64 expansions
CHDAStar	Hash Distributed A* on a shared-memory machine
CMsg	Node travelling to its owner
CHDAStarMPI	Hash Distributed A* with one MPI process per worker
CIDAStar	Iterative-deepening A* search of a Domain
CMissionariesCannibals	Missionaries and cannibals problem
CMQAStar	MultiQueue A*: one relaxed OPEN list and one CLOSED list shared by the workers
CNode	Node of the search graph
CNQueens	N-queens problem, with at most 32 queens
CBoard	Board: the queens placed and the row of each of them
COpenEntry	Entry of the OPEN list: the node and the g it had when pushed
CPASEOptions	Options of PASE
CPASE	Parallel A* for Slow Expansions
CPDBOptions	Options of the construction of an AdditivePDB
CTilePattern	Pattern of the sliding-tile puzzle and the ranking of its placements
CMoves	Cells adjacent to a cell, in the order up, left, right, down
CByteEntries	Entries of a pattern table, one byte each: the distance itself
CNibbleEntries	Entries of a pattern table, 4 bits each: the excess over Manhattan
CMod3Entries	Entries of a pattern table, the distance modulo 3, five in a byte
CParityBitEntries	Entries of a pattern table, the second bit of the distance, eight in a byte
CMinNibbleEntries	Entries of a pattern table, the least excess of each group of ranks
CSparseEntries	Entries of a pattern table whose excess is nonzero, by rank
CPatternTable	Distances of a pattern of the sliding-tile puzzle, encoded by Enc
CAdditivePDB	Additive heuristic of disjoint pattern tables
CSlidingTilePDB	Sliding-tile puzzle with an additive pattern database heuristic
CRomania	Trip on the road map of Romania
CRoad	Road and its length in km
CPBNFOptions	Options of SafePBNF
CSafePBNF	Safe Parallel Best-NBlock-First search
CSequenceScore	Sliding-tile puzzle with the sequence score heuristic of Nilsson
CWord128	Unsigned integer of 128 bits, as two words of 64
CSlidingTile	Sliding-tile puzzle on a board of at most 25 cells
CSlowDomain	Domain whose expansions cost a given amount of extra work
CSearchStats	Counters of a search
CSolution	Path from the initial state to a goal, and its cost
CSearchOptions	Options shared by all the searches
CSPAStar	Simple Parallel A*: one OPEN and one CLOSED list shared by the workers
CConcurrentClosed	Closed list shared by the workers, a lock-free set of the nodes
CLocal	Nodes that a worker allocates, and its spare node
CSuccessor	State generated, with its g, its h and its hash
CExplicitAdjacency	Arcs of a weighted graph, on the GraphBuilder and ArrayGraph of ADS
CGridAdjacency	Moves from a cell of a GridMap and their costs, on the GridGraph of ADS
CNodePool	Arena of the nodes, on the Arena of ADS, on huge pages
CNodeTable	Closed list, on the PointerTable of ADS, on huge pages
CHeapOpenList	OPEN list on the DaryHeap of ADS
CBucketOpenList	OPEN list on the BucketQueue of ADS, for integer costs
CTravelingSalesman	Traveling salesperson problem on at most 32 cities
CVacuumWorld	Vacuum world on a row of at most 32 cells
CWaterJugs	Water jugs problem, with up to 4 jugs of at most 65535 units
CBasicEvaluation	Outcome of the evaluation of a node, with values of type V
CBBLeaf	Leaf of the tree explored, or a node to start a search from
CBBValueTraits	What the B&B needs to know of the type V of its values
CBasicBBOptions	Options of a B&B with values of type V
CBBStats	Counters of a B&B
CBBSolution	Outcome of a B&B
CBBQueue	Open nodes of a B&B, ordered by a key
CItem	Open node
CBranchAndBoundSearch	Sequential best-first search with an incumbent
CDeterministicBranchAndBound	Parallel B&B by synchronous rounds
CFarmBranchAndBound	Master-worker B&B on a farm with feedback
CBasicKnapsack	0-1 knapsack, its items sorted by decreasing ratio of profit to weight
Cnode_type
CMPIBranchAndBoundSearch	Distributed B&B with one MPI process per worker
CMultiQueueBranchAndBound	Parallel B&B on the MultiQueue of ADS
CBasicParallelBBOptions	Options of the parallel B&B with values of type V
CBBIncumbent	Incumbent shared by the workers of a parallel B&B
CSharedBranchAndBound	Parallel B&B with one queue shared by the workers
CDistributedBranchAndBound	Parallel B&B with a queue per worker and the children sent to their owners
CMsg	Node travelling to its owner
CSelfSplitBranchAndBound	Parallel B&B by a split of the tree after a sampling
CStealingBranchAndBound	Parallel B&B by work stealing
CParallelParams	Parameters shared by the parallel searches
CStopwatch	Wall-clock stopwatch, started at construction