HOG2
OptimisticSearch< state, action, environment > Member List

This is the complete list of members for OptimisticSearch< state, action, environment >, including all inherited members.

AddAdditionalStartState(state &newState)OptimisticSearch< state, action, environment >
AddAdditionalStartState(state &newState, double cost)OptimisticSearch< state, action, environment >
bestSolutionOptimisticSearch< state, action, environment >private
boundOptimisticSearch< state, action, environment >private
CheckNextFocalNode()OptimisticSearch< state, action, environment >inline
CheckNextNode()OptimisticSearch< state, action, environment >
CheckNextOpenNode()OptimisticSearch< state, action, environment >inline
DoSingleSearchStep(std::vector< state > &thePath)OptimisticSearch< state, action, environment >virtual
Draw(Graphics::Display &d) constOptimisticSearch< state, action, environment >
envOptimisticSearch< state, action, environment >private
ExtractPathToStart(state &node, std::vector< state > &thePath)OptimisticSearch< state, action, environment >inline
ExtractPathToStartFromID(uint64_t node, std::vector< state > &thePath)OptimisticSearch< state, action, environment >
fOptimisticSearch< state, action, environment >
fhatOptimisticSearch< state, action, environment >
GenericSearchAlgorithm()GenericSearchAlgorithm< state, action, environment >inline
GetClosedItem(const state &s, OptimisticOpenClosedData< state > &)OptimisticSearch< state, action, environment >
GetClosedListGCost(const state &val, double &gCost) constOptimisticSearch< state, action, environment >
GetFocalItem(unsigned int which)OptimisticSearch< state, action, environment >inline
GetFocalListGCost(const state &val, double &gCost) constOptimisticSearch< state, action, environment >
GetItem(unsigned int which)OptimisticSearch< state, action, environment >inline
GetMemoryUsage()OptimisticSearch< state, action, environment >
GetName()OptimisticSearch< state, action, environment >virtual
GetNodesExpanded() constOptimisticSearch< state, action, environment >inlinevirtual
GetNodesTouched() constOptimisticSearch< state, action, environment >inlinevirtual
GetNumFocalItems()OptimisticSearch< state, action, environment >inline
GetNumItems()OptimisticSearch< state, action, environment >inline
GetNumOpenItems()OptimisticSearch< state, action, environment >inline
GetOpenItem(unsigned int which)OptimisticSearch< state, action, environment >inline
GetOpenListGCost(const state &val, double &gCost) constOptimisticSearch< state, action, environment >
GetOptimalityBound()OptimisticSearch< state, action, environment >inline
GetParent(const state &s)OptimisticSearch< state, action, environment >
GetPath(environment *env, const state &from, const state &to, std::vector< state > &thePath)OptimisticSearch< state, action, environment >virtual
GetPath(environment *, const state &, const state &, std::vector< action > &)OptimisticSearch< state, action, environment >virtual
GetReopenNodes()OptimisticSearch< state, action, environment >inline
GetStateLocation(const state &val)OptimisticSearch< state, action, environment >inline
GetUniqueNodesExpanded()OptimisticSearch< state, action, environment >inline
GetWeight()OptimisticSearch< state, action, environment >inline
goalOptimisticSearch< state, action, environment >
HaveExpandedState(const state &val)OptimisticSearch< state, action, environment >inline
InitializeSearch(environment *env, const state &from, const state &to, std::vector< state > &thePath)OptimisticSearch< state, action, environment >virtual
LogFinalStats(StatCollection *)OptimisticSearch< state, action, environment >inlinevirtual
neighborsOptimisticSearch< state, action, environment >private
nodesExpandedOptimisticSearch< state, action, environment >private
nodesTouchedOptimisticSearch< state, action, environment >private
OpenGLDraw() constOptimisticSearch< state, action, environment >virtual
GenericSearchAlgorithm::OpenGLDraw(const environment *env) constGenericSearchAlgorithm< state, action, environment >inlinevirtual
openList typedefOptimisticSearch< state, action, environment >
OptimisticSearch()OptimisticSearch< state, action, environment >inline
PrintStats()OptimisticSearch< state, action, environment >
reopenNodesOptimisticSearch< state, action, environment >private
ResetNodeCount()OptimisticSearch< state, action, environment >inline
SetHeuristic(Heuristic< state > *h)OptimisticSearch< state, action, environment >inline
SetOptimalityBound(double w)OptimisticSearch< state, action, environment >inline
SetReopenNodes(bool re)OptimisticSearch< state, action, environment >inline
SetWeight(double w)OptimisticSearch< state, action, environment >inline
startOptimisticSearch< state, action, environment >
theHeuristicOptimisticSearch< state, action, environment >private
uniqueNodesExpandedOptimisticSearch< state, action, environment >private
weightOptimisticSearch< state, action, environment >private
~GenericSearchAlgorithm()GenericSearchAlgorithm< state, action, environment >inlinevirtual
~OptimisticSearch()OptimisticSearch< state, action, environment >inlinevirtual