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