modules.dox File Reference

Concepts
concept	PBeFS_di_unipi_it::DiskDomain
	a 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
concept	PBeFS_di_unipi_it::IncrementalDistribution
	a distribution whose owners follow the moves
concept	PBeFS_di_unipi_it::Domain
	a search domain
concept	PBeFS_di_unipi_it::FeatureDomain
	a Domain whose states are described by a set of features
concept	PBeFS_di_unipi_it::IncrementalFeatureDomain
	a FeatureDomain that also gives the features changed by a move
concept	PBeFS_di_unipi_it::AbstractFeatureDomain
	a FeatureDomain that also provides a feature projection
concept	PBeFS_di_unipi_it::AbstractStateDomain
	a Domain with a state abstraction
concept	PBeFS_di_unipi_it::NBlockDomain
	a Domain whose state space is partitioned into nblocks
concept	PBeFS_di_unipi_it::PairwiseDomain
	a Domain with a heuristic between any two states
concept	PBeFS_di_unipi_it::OperatorDomain
	a Domain that knows the operator by which a state was generated
concept	PBeFS_di_unipi_it::PerfectHashDomain
	a Domain with a perfect hash of its states
concept	PBeFS_di_unipi_it::BBValue
	a type of values of a B&B: signed, totally ordered, made from an int, and with its BBValueTraits
concept	PBeFS_di_unipi_it::BBEvaluator
	what evaluates and branches the nodes of a B&B
concept	PBeFS_di_unipi_it::BranchAndBound
	a B&B problem
concept	PBeFS_di_unipi_it::HashedBranchAndBound
	a B&B problem that gives a hash of its nodes
concept	PBeFS_di_unipi_it::EstimatingBranchAndBound
	a B&B problem that estimates the best feasible value under a node
concept	PBeFS_di_unipi_it::MultiQueueValue
	the values that the MultiQueue of ADS takes as keys: arithmetic, with a greatest value, and atomic with no lock
concept	PBeFS_di_unipi_it::MPIBranchAndBound
	a B&B problem whose nodes and values can travel between processes