Concepts

Here is a list of all concepts with brief descriptions:

[detail level 12]

NPBeFS_di_unipi_it	Namespace for the Parallel Best-First Search library
RDiskDomain	Domain that DDDAStar can search: integer costs, since a bucket is a pair of values, and states that are trivially copyable, since they are written to the disk as their bytes
RIncrementalDistribution	Distribution whose owners follow the moves
RDomain	Search domain
RFeatureDomain	Domain whose states are described by a set of features
RIncrementalFeatureDomain	FeatureDomain that also gives the features changed by a move
RAbstractFeatureDomain	FeatureDomain that also provides a feature projection
RAbstractStateDomain	Domain with a state abstraction
RNBlockDomain	Domain whose state space is partitioned into nblocks
RPairwiseDomain	Domain with a heuristic between any two states
ROperatorDomain	Domain that knows the operator by which a state was generated
RPerfectHashDomain	Domain with a perfect hash of its states
RBBValue	Type of values of a B&B: signed, totally ordered, made from an int, and with its BBValueTraits
RBBEvaluator	What evaluates and branches the nodes of a B&B
RBranchAndBound	B&B problem
RHashedBranchAndBound	B&B problem that gives a hash of its nodes
REstimatingBranchAndBound	B&B problem that estimates the best feasible value under a node
RMPIBranchAndBound	B&B problem whose nodes and values can travel between processes
RMultiQueueValue	Values that the MultiQueue of ADS takes as keys: arithmetic, with a greatest value, and atomic with no lock