| ►NAngleUtil | |
| CAngleSearchNode | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NAStar3Util | |
| CNodeEqual | |
| CNodeHash | |
| CSearchNode | |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NAStarDelayUtil | |
| CFExtract | |
| CGGreater | |
| CSearchNode | |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NCanonicalGrid | |
| CCanonicalGrid | |
| CxyLoc | |
| ►NCFOptimalRefinementConstants | |
| CGNode | |
| CNodeCompare | |
| CNodeEqual | |
| CNodeHash | |
| ►NclusterUtil | |
| CEdgeEqual | |
| CEdgeHash | |
| ►NDALRTA | |
| CborderData | |
| CcompareBorderData | |
| CdaLRTAStar | |
| ClssLearnedData | |
| ►NDWG | |
| CabstractState | |
| CDynamicWeightedGrid | |
| CDynamicWeightedGridEnvironment | |
| Cedge | |
| CregionData | |
| CSectorData | |
| ►NFLRTA | |
| CborderData | |
| CcompareBorderData | |
| CdblCmp | |
| CFLRTAStar | |
| ClearnedStateData | |
| ►NfocalOpenClosed | |
| CFocalOpenClosed | |
| CFocalOpenClosedData | |
| ►NGenericAStarUtil | |
| CSearchNode | |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NGraphics | |
| ►CDisplay | |
| Cdata | |
| CdrawInfo | |
| ClineInfo | |
| Csegments | |
| CshapeInfo | |
| CtextInfo | |
| CtriangleInfo | |
| Cpoint | |
| Crect | |
| ►NGraphInconsistencyExamples | |
| CGraphHeuristic | |
| ►NHLRTA | HLRTA* |
| CHLRTAStar | |
| ClearnedData | |
| ►NIBEX | |
| CBFHSCompare | |
| ►CIBEX | |
| CcostInterval | |
| CsearchBounds | |
| CUBSNode | |
| ►NIRAStarConstants | |
| CGNode | |
| CNodeCompare | |
| CNodeEqual | |
| CNodeHash | |
| ►NIRDijkstraConstants | |
| CGNode | |
| CNodeCompare | |
| CNodeEqual | |
| CNodeHash | |
| ►NMeroBUtil | |
| CGGreater | |
| CgraphGenerator | |
| CSearchNode | |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NMPLRTA | |
| ClearnedData | |
| CMPLRTAStar | |
| ►NOldOldTemplateAStarUtil | |
| CSearchNode | A search node class to use with hash maps |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeHash | |
| ►NOldSearchCode | |
| CGraphSearchEnvironment | |
| CMapGraphSearchEnvironment | |
| CMapSearchEnvironment | |
| CSearchEnvironment | |
| ►NPermutationPuzzle | |
| CArbitraryGoalPermutation | |
| CPDBTreeNode | |
| CPermutationPuzzleEnvironment | Note, assumes that state has a public vector<int> called puzzle in which the permutation is held |
| ►NPlotting | |
| CLine | |
| CPlot2D | |
| CPoint | |
| ►NPropUtil | |
| CFExtract | |
| CGGreater | |
| CgraphGenerator | |
| CSearchNode | |
| CSearchNodeCompare | |
| CSearchNodeEqual | |
| CSearchNodeEX | |
| CSearchNodeHash | |
| CStateEX | |
| CTGreater | |
| ►NSnakeBird | |
| CSnakeBird | |
| CSnakeBirdAction | |
| CSnakeBirdAnimationStep | |
| CSnakeBirdState | |
| ►Nstd | |
| Chash< canGraphState > | |
| Chash< FlingBoard > | |
| Chash< MNPuzzleState< w, h > > | |
| Chash< PancakePuzzleState< N > > | |
| Chash< RubikEdgeStateArray > | |
| Chash< RubikEdgeStateBits > | |
| Chash< RubiksCornerStateArray > | |
| Chash< RubiksCornerStateBits > | |
| Chash< RubiksState > | |
| Chash< SnakeBird::SnakeBirdState > | |
| Chash< std::pair< double, double > > | |
| Chash< std::pair< graphState, graphState > > | |
| Chash< voxelGridState > | |
| Chash< VoxelUtils::triangle > | |
| Chash< VoxelUtils::vn > | |
| Chash< xyLoc > | |
| ►NVoxelUtils | |
| CPoint3D | |
| Ctriangle | |
| Cvn | |
| Cwork | |
| CAbsGraphEnvironment | A graph environment to use with the a graph abstraction |
| CAbsMapUnit | A simple map-based unit |
| CabstractGridState | |
| CAbstractionSearchEnvironment | |
| CabstractMove | |
| CAbstractWeightedSearchAlgorithm | A search algorithm which combines direction maps with abstraction |
| Caction3d | |
| CAHash64 | |
| CairplaneAction | |
| CAirplaneEnvironment | |
| CairplaneState | |
| CarmAngles | |
| CarmRotations | |
| CArmToArmCompressedHeuristic | |
| CArmToArmHeuristic | |
| CArmToTipHeuristic | |
| CaStar | |
| CaStar2 | A implementation of A* which just re-uses code from PRA* |
| CAStarCompare | |
| CAStarCompareWithF | |
| CAStarDelay | |
| CAStarEpsilon | A templated version of A*, based on HOG genericAStar |
| CaStarOld | A sample A* implementation |
| CAStarOpenClosed | |
| CAStarOpenClosedData | |
| CAStarOpenClosedDataWithF | |
| CBaseMapOccupancyInterface | |
| CBDCompare | |
| CBDIndexOpenClosed | |
| CBDIndexOpenClosedData | |
| CBDOpenClosed | |
| CBDOpenClosedData | |
| CBFHSCompare | |
| CBFS | |
| CBIdijkstra | |
| CBidirectionalProblemAnalyzer | |
| CBilliardBallUnit | A configurable billiard ball unit |
| CBitMapHeader | |
| CBitMapPic | |
| CBitVector | |
| Cbloom_filter | |
| ►Cbloom_parameters | |
| Coptimal_parameters_t | |
| CBloomFilter | |
| Cbmp_header | |
| ►CBOAStar | |
| Citem | |
| CstateInfo | |
| CborderData | |
| CbucketChanges | |
| CbucketData | |
| CbucketInfo | |
| ►CBucketOpenClosed | |
| CqData | |
| CBurnedPancakePuzzle | |
| CBurnedPancakePuzzleState | |
| CcanGraphState | |
| CCanonicalGraphEnvironment | |
| CCFOptimalRefinement | |
| CCGPoint | |
| CCGRect | |
| CCGSize | |
| CCluster | |
| CClusterAbstraction | Cluster abstraction for HPA* algorithm as described in (Botea,Mueller,Schaeffer 2004) |
| CClusterSearchEnvironment | |
| CCombinations | |
| CcommandLineCallbackData | ** |
| CCompare | |
| CcompareBorderData | |
| CcompareStateData | |
| Ccompressible_bloom_filter | |
| CConfigEnvironment | |
| Cconstraint | |
| CConstraint | |
| CcorridorAStar | Corridor AStar builds a a* path between two nodes, restricting itself to a particular corridor, if defined |
| Ccosts | |
| CcraStar | The pra* search algorithm which does partial pathfinding using abstraction |
| CCubie | |
| ►CDelayedHeuristicAStar | A templated version of A*, based on TemplateAStar, which delays heuristic lookups as long as possible and batches them |
| CtempData | |
| CdeltaSpeedHeading | |
| CDFID | |
| CDFS | |
| CDirectional2DEnvironment | |
| CdirHeuristicTable | |
| CDiskBitFile | |
| CDPSData | A templated version of A*, based on HOG genericAStar |
| CDVCBS | |
| CDVCBSOpenClosed | |
| CDVCBSOpenClosedData | |
| CDVCBSQueue | |
| CDynamicPotentialSearch | |
| ►CEBSearch | |
| CsearchData | |
| CEDAStar | |
| Cedge | Edge class for connections between node in a Graph |
| CEdgeData | |
| CEntrance | |
| CEntropy | |
| CEntropyInfo | |
| CEPEAOpenClosedData | |
| CEPEAStar | A templated version of A*, based on HOG genericAStar |
| CEPEAStarCompare | |
| CEpisodicSimulation | |
| CEuclideanDistance | |
| CExperiment | |
| CFallingBoxTransition | |
| CfieldData | |
| ►CFixedSizeSet | |
| Cfield | |
| CFling | |
| CFlingBoard | |
| CFlingMove | |
| CflipMove | |
| CFlipSide | |
| CFlipSideState | |
| CfMM | |
| CfMMCompare | |
| CFMMOpenClosedData | |
| ►CFocal | A generic focal list algorithm |
| CFocalTreapItem | |
| COpenTreapItem | |
| CSearchState | |
| ►CFocalAdd | A generic focal list algorithm that returns linearly bounded solutions Open is sorted by f; provide a function for sorting focal Provide a weight w Given minimum f in open, anything up to w*minf goes into focal Expand from focal until empty; otherwise expand from open |
| CFocalTreapItem | |
| COpenTreapItem | |
| CSearchState | |
| CFourBitArray | |
| CframeCallbackData | |
| CFringeSearch | |
| CFrontierBFS | |
| CfssIterator | |
| CfullData | |
| CFunctionApproximator | |
| CGBFSCompare | |
| CGenericAStar | |
| CGenericIDAStar | |
| CGenericPatrolUnit | |
| CGenericSearchAlgorithm | |
| CGenericSearchUnit | A general unit which collects path information from a GenericSearchAlgorithm and incrementally executes that path in the world |
| CglssLearnedData | |
| CgLSSLRTAStar | |
| CGoalTester | |
| CGraph | A generic Graph class |
| Cgraph_object | Parent class for nodes and edges allowing them to be stored in a Heap or manipulated with other data structures |
| CGraphAbstraction | A generic class for basic operations on Graph abstractions |
| CGraphAlgorithm | |
| CGraphCheck | |
| CGraphDistanceHeuristic | |
| CGraphEnvironment | |
| CGraphHeuristic | |
| CGraphHeuristicContainer | |
| CGraphLabelHeuristic | |
| CGraphMapHeuristic | |
| CGraphMapInconsistentHeuristic | |
| CGraphMapPerfectHeuristic | |
| CgraphMove | |
| CGraphOccupancyInterface | Occupancy interface which works with graphState and graphMove A wrapper to use with an exisitng BaseMapOccupancyInterface |
| CGraphPuzzleDistanceHeuristic | |
| CGraphRefinementEnvironment | |
| CGraphStraightLineHeuristic | |
| CGreedyDMUnit | |
| CGridData | |
| ChalfTile | |
| CHash64 | |
| CHashDouble | |
| Cheader | |
| CHeap | A simple & efficient Heap class which uses Graph objects |
| CHeuristic | |
| CHeuristicLearningMeasure | |
| CHeuristicLookupBuffer | |
| CheuristicProvider | |
| CHeuristicTable | |
| CHeuristicTableEntry | |
| CHeuristicTreeNode | |
| CHexagon | |
| CHexagonAction | |
| CHexagonEnvironment | |
| CHexagonSearchState | |
| CHexagonState | |
| ChpaStar | HPA* algorithm as described in (Botea,Mueller,Schaeffer 2004) |
| ChumanUnit | |
| CIDAStar | |
| CIDAStarCR | |
| CImprovedOptimisticSearch | A templated version of A*, based on HOG genericAStar |
| CIncrementalBFS | |
| ►CIncrementalBGS | |
| CBFHSCompare | |
| CcostInterval | |
| CIBEXData | |
| CsearchData | |
| ►CIncrementalBTS | |
| CcostInterval | |
| CcurrSearchState | |
| CIBEXData | |
| CsearchData | |
| CIncrementalDFID | |
| ►CIncrementalIDA | |
| CcurrSearchState | |
| CIndexCompare | |
| CIndexCompareWithF | |
| CIndexOpenClosed | |
| CIndexOpenClosedData | This open/closed list is designed for state spaces where the hash is an index that is small enough that we can create a table for all indices |
| CIndexOpenClosedDataWithF | |
| CInteractiveWitnessState | |
| CIOSCompare | |
| CIOSOpenClosedData | |
| CIRAStar | |
| CIRDijkstra | |
| CjoystickCallbackData | |
| ►CJson | Simple class that alows for building a tree of data that can be serialized into Json format |
| CNode | |
| ►CNodeValue | |
| CValues | |
| CkeyboardCallbackData | |
| ClabelValue | |
| ClearnedData | |
| CLearningAlgorithm | |
| CLearningUnit | |
| CLexPermutationPDB | This class does the basic permutation calculation with a regular N^2 permutation computation |
| Cline2d | ** |
| CLinearRegression | |
| CLineTransition | |
| ►CLoadedBBAbstraction | |
| CBoundingBox | |
| CLoadedCliqueAbstraction | A loaded abstraction based on the reduction of cliques |
| Cloc | |
| CLogisticRegression | |
| CLRTAStar | |
| ClssLearnedData | |
| CLSSLRTAStar | |
| CMap | A tile-based representation of the world |
| CMap2DConstrainedEnvironment | |
| ►CMap2DHeading | |
| ChdData | |
| CMap2DSectorAbstraction | |
| CMap3DGrid | |
| CMapCliqueAbstraction | A map abstraction based on the reduction of cliques |
| CMapEnvironment | |
| CMapFlatAbstraction | |
| CMapLineAbstraction | |
| CMapOverlay | |
| CMapProvider | |
| CMapSectorAbstraction | |
| CMapUnit | A simple map-based unit |
| CmcData | |
| CMCEnvironment | |
| CmcMovementState | |
| CMeroB | |
| CMinBloomFilter | |
| CMinimalSectorAbstraction | MinimalSectorAbstraction |
| CMM | |
| CMMCompare | |
| CMNAgentEnvironment | |
| CMNAgentPuzzleState | |
| CMNPuzzle | |
| CMNPuzzleState | |
| CMonoFont | |
| CMountainCarEnvironment | |
| CMountainCarState | |
| CmouseCallbackData | |
| CmouseCallbackData2 | |
| CMR1KPermutation | |
| CMR1PermutationPDB | This class uses the first of two Myrvold-Russkey ranking functions which run in linear time, but does not produce a lexicographical ranking |
| CNaryTree | |
| CNBitArray | This class supports compact n-bit arrays |
| CNBS | |
| CNBSCompareOpenReady | |
| CNBSCompareOpenWaiting | |
| CNBSQueue | |
| CNN | |
| Cnode | Nodes to be stored within a Graph |
| CNodeLimitAbstraction | |
| CNQueenAction | |
| CNQueens | |
| CNQueenState | |
| COccupancyInterface | |
| COctileHeuristic | |
| COctreeIndex | |
| COffsetHeuristic | |
| COldTemplateAStar | A templated version of A*, based on HOG genericAStar |
| COpenClosedList | A simple Heap class |
| COpenListB | A simple & efficient Heap class |
| COptimisticCompare | |
| COptimisticOpenClosedData | |
| COptimisticSearch | A templated version of A*, based on HOG genericAStar |
| CpancakeMovePair | |
| CPancakePuzzle | |
| CPancakePuzzleState | |
| CpancakeStatePair | |
| CParallelIDAStar | |
| Cpath | A linked list of nodes which form a continuous path |
| CpatrolUnit | |
| CPDBHeuristic | |
| CPEAStar | A templated version of A*, based on HOG genericAStar |
| CPEAStarCompare | |
| Cperceptron | |
| CPermutationPDB | This class does the basic permutation calculation with a regular N^2 permutation computation |
| CPermutations | |
| CpraStar | The pra* search algorithm which does partial pathfinding using abstraction |
| CpraStar2 | The pra* search algorithm which does partial pathfinding using abstraction |
| CpraStarUnit | A unit which caches path information to speed pra* |
| CProp | |
| CPublicUnitInfo | |
| CPuzzleInferenceRuleSet | |
| CRacetrack | |
| CRacetrackMove | |
| CRacetrackState | |
| CRadiusAbstraction | |
| CRandomerUnit | A unit that moves in random directions for every step |
| CRandomUnit | A unit that moves in random directions changing direction randomly |
| CRC | |
| CRCPDB | |
| CRCState | |
| CrecCamera | |
| CrecContext | |
| CrecFrustum | |
| CrecRotation | |
| CrecVec | A generic vector (essentially the same as a point, but offers normalization) |
| CRegionData | |
| CreservationProvider | |
| CrewardSeekingUnit | |
| CrewardUnit | |
| CrgbColor | A color; r/g/b are between 0...1 |
| CRHRUnit | A simple unit that attempts to follow walls using the right hand rule |
| CRoadMap | |
| CRoboticArm | |
| CRoboticArmHeuristic | |
| CRubik7Edge | |
| CRubik7EdgeMove | |
| CRubik7EdgeState | |
| CRubikArbitraryGoalPDB | |
| CRubikCornerMove | |
| CRubikCornerPDB | |
| CRubikDualPDB | |
| CRubikEdge | |
| CRubikEdgeMove | |
| CRubikEdgeOrientationPDB | |
| CRubikEdgePDB | |
| CRubikEdgeStateArray | |
| CRubikEdgeStateBits | |
| CRubikPDB | |
| CRubiksCorner | |
| CRubiksCornerStateArray | |
| CRubiksCornerStateBits | |
| CRubiksCube | |
| CRubiksState | |
| CScenarioLoader | A class which loads and stores scenarios from files |
| CScreenTransition | |
| CSearchAlgorithm | A generic algorithm which can be used for pathfinding |
| CSearchEnvironment | |
| CSearchUnit | A general unit which collects path information from a SearchAlgorithm and incrementally executes that path in the world |
| CSectorData | |
| CsectorInfo | |
| CSequenceAlignment | |
| CSFBDPancakeEnvironment | |
| CSFIDAStar | |
| CSharedAMapGroup | A group which incrementally builds a map of the world as the units in the group explore the Graph |
| CSharedQueue | |
| CSimpleNode | |
| CSimulationInfo | |
| CSolution | |
| CspreadExecSearchAlgorithm | |
| CspreadPRAStar | |
| CStatCollection | For collecting stats across different parts of the simulation |
| Cstate3d | |
| CstateData | |
| Cstatistics | |
| CstatValue | |
| CsteeringAction | |
| CSteeringEnvironment | |
| CsteeringState | |
| CstructArray | |
| CsVal | |
| CTable | |
| CTeleportUnit | A unit which randomly teleports around the world |
| CtempEdgeData | |
| CTemplateAStar | A templated version of A*, based on HOG genericAStar |
| CTextBox | |
| CTextOverlay | |
| CTile | |
| CTimer | |
| CTimeStep | Private per-unit unitSimulation data |
| CTOH | |
| CTOHMove | |
| CTOHPDB | |
| CTOHState | |
| CTopSpin | |
| CTopSpinGraph | |
| CTopSpinGraphData | |
| CTopSpinGraphHeuristic | |
| CTopSpinState | |
| ►CTreap | |
| CTreapNode | |
| CTreePermutationPDB | This class does the basic permutation calculation in lexicographical order |
| CUnit | |
| CUnitCostBidirectionalBFS | |
| CUnitGroup | |
| CUnitInfo | |
| CUnitSimulation | The basic simulation class for the world |
| CupdateData | |
| CVector2D | |
| CvectorCache | |
| Cviewport | |
| CVisualizableGenericSearchAlgorithm | |
| CVoxelGrid | |
| CvoxelGridState | |
| ►CVoxels | |
| COctreeNode | |
| CvoxelWorld | |
| CvoxelState | |
| CWeightedHeuristic | |
| CWeightedMap2DEnvironment | |
| CWeightedUnitGroup | |
| CwindowCallbackData | |
| ►CWitness | |
| CmustCrossEdgeConstraint | |
| CPathLocation | |
| CseparationObject | |
| CWitnessRegionConstraint | |
| CWitnessState | |
| CworkUnit | |
| CxyhAct | |
| CxyhLoc | |
| CxyLoc | |
| CxyLocHash | |
| CxySpeedHeading | |
| CxytLoc | |
| CZeroHeuristic | |
