HOG2
Public Member Functions | Private Member Functions | Private Attributes | List of all members
DVCBS< state, action, environment, dataStructure, priorityQueue > Class Template Reference

#include <DVCBS.h>

Collaboration diagram for DVCBS< state, action, environment, dataStructure, priorityQueue >:
Collaboration graph
[legend]

Public Member Functions

 DVCBS (int tieBreaking, bool allSolutions=false, bool leq=false)
 
 DVCBS (bool allSolutions=false, bool leq=false)
 
virtual ~DVCBS ()
 
void GetPath (environment *env, const state &from, const state &to, Heuristic< state > *forward, Heuristic< state > *backward, std::vector< state > &thePath)
 
bool InitializeSearch (environment *env, const state &from, const state &to, Heuristic< state > *forward, Heuristic< state > *backward, std::vector< state > &thePath)
 
bool ExpandAVertexCover (std::vector< state > &thePath)
 
bool DoSingleSearchStep (std::vector< state > &thePath)
 
uint64_t getForwardUnnecessaryNodesInPath ()
 
uint64_t getBackwardUnnecessaryNodesInPath ()
 
uint64_t getForwardMeetingPoint ()
 
uint64_t getBackwardMeetingPoint ()
 
uint64_t getOptimalNumberOfExpantions ()
 
virtual const char * GetName ()
 
void ResetNodeCount ()
 
const int GetNumForwardItems ()
 
const DVCBSOpenClosedData< state > & GetForwardItem (unsigned int which)
 
const int GetNumBackwardItems ()
 
const DVCBSOpenClosedData< state > & GetBackwardItem (unsigned int which)
 
void SetForwardHeuristic (Heuristic< state > *h)
 
void SetBackwardHeuristic (Heuristic< state > *h)
 
stateLocation GetNodeForwardLocation (const state &s)
 
stateLocation GetNodeBackwardLocation (const state &s)
 
double GetNodeForwardG (const state &s)
 
double GetNodeBackwardG (const state &s)
 
uint64_t GetNodesExpanded () const
 
uint64_t GetNodesTouched () const
 
uint64_t GetDoubleExpansions () const
 
uint64_t GetNecessaryExpansions () const
 
double GetSolutionCost () const
 
double GetExpansionUntilFirstSolution () const
 
void OpenGLDraw () const
 

Private Member Functions

void ExtractFromMiddle (std::vector< state > &thePath)
 
double ExtractCostFromMiddle ()
 
void ExtractPathToGoal (state &node, std::vector< state > &thePath)
 
void ExtractPathToGoalFromID (uint64_t node, std::vector< state > &thePath)
 
double ExtractCostToGoal (state &node)
 
double ExtractCostToGoalFromID (uint64_t node)
 
void ExtractPathToStart (state &node, std::vector< state > &thePath)
 
void ExtractPathToStartFromID (uint64_t node, std::vector< state > &thePath)
 
double ExtractCostToStart (state &node)
 
double ExtractCostToStartFromID (uint64_t node)
 
void OpenGLDraw (const priorityQueue &queue) const
 
void Expand (uint64_t nextID, priorityQueue &current, priorityQueue &opposite, Heuristic< state > *heuristic, const state &target)
 

Private Attributes

uint64_t nodesTouched
 
uint64_t nodesExpanded
 
state middleNode
 
double currentCost
 
double expansionsUntilSolution
 
double currentSolutionEstimate
 
std::vector< state > neighbors
 
environment * env
 
std::unordered_map< double, int > counts
 
bool isAllSolutions
 
bool isLEQ
 
dataStructure queue
 
state goal
 
state start
 
Heuristic< state > * forwardHeuristic
 
Heuristic< state > * backwardHeuristic
 
bool expand
 
double currentPr
 
int tieBreakingPolicy
 
uint64_t forwardUnnecessaryNodesInPath
 
uint64_t backwardUnnecessaryNodesInPath
 
uint64_t forwardMeetingPoint
 
uint64_t backwardMeetingPoint
 

Detailed Description

template<class state, class action, class environment, class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
class DVCBS< state, action, environment, dataStructure, priorityQueue >

Definition at line 23 of file DVCBS.h.

Constructor & Destructor Documentation

◆ DVCBS() [1/2]

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
DVCBS< state, action, environment, dataStructure, priorityQueue >::DVCBS ( int  tieBreaking,
bool  allSolutions = false,
bool  leq = false 
)
inline

◆ DVCBS() [2/2]

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
DVCBS< state, action, environment, dataStructure, priorityQueue >::DVCBS ( bool  allSolutions = false,
bool  leq = false 
)
inline

◆ ~DVCBS()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
virtual DVCBS< state, action, environment, dataStructure, priorityQueue >::~DVCBS ( )
inlinevirtual

Definition at line 39 of file DVCBS.h.

Member Function Documentation

◆ DoSingleSearchStep()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::DoSingleSearchStep ( std::vector< state > &  thePath)

Definition at line 429 of file DVCBS.h.

◆ Expand()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
void DVCBS< state, action, environment, dataStructure, priorityQueue >::Expand ( uint64_t  nextID,
priorityQueue &  current,
priorityQueue &  opposite,
Heuristic< state > *  heuristic,
const state &  target 
)
private

◆ ExpandAVertexCover()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::ExpandAVertexCover ( std::vector< state > &  thePath)

Definition at line 275 of file DVCBS.h.

References fless(), flesseq(), kClosed, and kOpenReady.

◆ ExtractCostFromMiddle()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
double DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostFromMiddle
private

Definition at line 405 of file DVCBS.h.

◆ ExtractCostToGoal()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToGoal ( state &  node)
inlineprivate

◆ ExtractCostToGoalFromID()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToGoalFromID ( uint64_t  node)
inlineprivate

◆ ExtractCostToStart()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToStart ( state &  node)
inlineprivate

◆ ExtractCostToStartFromID()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToStartFromID ( uint64_t  node)
inlineprivate

◆ ExtractFromMiddle()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractFromMiddle ( std::vector< state > &  thePath)
private

Definition at line 417 of file DVCBS.h.

◆ ExtractPathToGoal()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToGoal ( state &  node,
std::vector< state > &  thePath 
)
inlineprivate

◆ ExtractPathToGoalFromID()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToGoalFromID ( uint64_t  node,
std::vector< state > &  thePath 
)
inlineprivate

◆ ExtractPathToStart()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToStart ( state &  node,
std::vector< state > &  thePath 
)
inlineprivate

◆ ExtractPathToStartFromID()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToStartFromID ( uint64_t  node,
std::vector< state > &  thePath 
)
inlineprivate

◆ GetBackwardItem()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
const DVCBSOpenClosedData<state>& DVCBS< state, action, environment, dataStructure, priorityQueue >::GetBackwardItem ( unsigned int  which)
inline

◆ getBackwardMeetingPoint()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::getBackwardMeetingPoint ( )
inline

◆ getBackwardUnnecessaryNodesInPath()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::getBackwardUnnecessaryNodesInPath ( )
inline

◆ GetDoubleExpansions()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::GetDoubleExpansions

Definition at line 553 of file DVCBS.h.

References kClosed.

◆ GetExpansionUntilFirstSolution()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::GetExpansionUntilFirstSolution ( ) const
inline

◆ GetForwardItem()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
const DVCBSOpenClosedData<state>& DVCBS< state, action, environment, dataStructure, priorityQueue >::GetForwardItem ( unsigned int  which)
inline

◆ getForwardMeetingPoint()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::getForwardMeetingPoint ( )
inline

◆ getForwardUnnecessaryNodesInPath()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::getForwardUnnecessaryNodesInPath ( )
inline

◆ GetName()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
virtual const char* DVCBS< state, action, environment, dataStructure, priorityQueue >::GetName ( )
inlinevirtual

Definition at line 69 of file DVCBS.h.

◆ GetNecessaryExpansions()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNecessaryExpansions ( ) const
inline

◆ GetNodeBackwardG()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeBackwardG ( const state &  s)
inline

◆ GetNodeBackwardLocation()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
stateLocation DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeBackwardLocation ( const state &  s)
inline

◆ GetNodeForwardG()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeForwardG ( const state &  s)
inline

◆ GetNodeForwardLocation()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
stateLocation DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeForwardLocation ( const state &  s)
inline

◆ GetNodesExpanded()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodesExpanded ( ) const
inline

◆ GetNodesTouched()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodesTouched ( ) const
inline

◆ GetNumBackwardItems()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
const int DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNumBackwardItems ( )
inline

◆ GetNumForwardItems()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
const int DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNumForwardItems ( )
inline

◆ getOptimalNumberOfExpantions()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::getOptimalNumberOfExpantions ( )
inline

◆ GetPath()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
void DVCBS< state, action, environment, dataStructure, priorityQueue >::GetPath ( environment *  env,
const state &  from,
const state &  to,
Heuristic< state > *  forward,
Heuristic< state > *  backward,
std::vector< state > &  thePath 
)

Definition at line 233 of file DVCBS.h.

◆ GetSolutionCost()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::GetSolutionCost ( ) const
inline

◆ InitializeSearch()

template<class state , class action , class environment , class dataStructure , class priorityQueue >
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::InitializeSearch ( environment *  env,
const state &  from,
const state &  to,
Heuristic< state > *  forward,
Heuristic< state > *  backward,
std::vector< state > &  thePath 
)

Definition at line 244 of file DVCBS.h.

◆ OpenGLDraw() [1/2]

template<class state , class action , class environment , class dataStructure , class priorityQueue >
void DVCBS< state, action, environment, dataStructure, priorityQueue >::OpenGLDraw

Definition at line 572 of file DVCBS.h.

◆ OpenGLDraw() [2/2]

template<class state , class action , class environment , class dataStructure , class priorityQueue >
void DVCBS< state, action, environment, dataStructure, priorityQueue >::OpenGLDraw ( const priorityQueue &  queue) const
private

Definition at line 579 of file DVCBS.h.

References kClosed, kOpenReady, and kOpenWaiting.

◆ ResetNodeCount()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::ResetNodeCount ( )
inline

◆ SetBackwardHeuristic()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::SetBackwardHeuristic ( Heuristic< state > *  h)
inline

◆ SetForwardHeuristic()

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
void DVCBS< state, action, environment, dataStructure, priorityQueue >::SetForwardHeuristic ( Heuristic< state > *  h)
inline

Member Data Documentation

◆ backwardHeuristic

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
Heuristic<state>* DVCBS< state, action, environment, dataStructure, priorityQueue >::backwardHeuristic
private

◆ backwardMeetingPoint

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::backwardMeetingPoint
private

◆ backwardUnnecessaryNodesInPath

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::backwardUnnecessaryNodesInPath
private

◆ counts

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
std::unordered_map<double, int> DVCBS< state, action, environment, dataStructure, priorityQueue >::counts
private

◆ currentCost

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::currentCost
private

◆ currentPr

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::currentPr
private

Definition at line 221 of file DVCBS.h.

◆ currentSolutionEstimate

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::currentSolutionEstimate
private

Definition at line 205 of file DVCBS.h.

◆ env

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
environment* DVCBS< state, action, environment, dataStructure, priorityQueue >::env
private

◆ expand

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::expand
private

Definition at line 219 of file DVCBS.h.

◆ expansionsUntilSolution

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
double DVCBS< state, action, environment, dataStructure, priorityQueue >::expansionsUntilSolution
private

◆ forwardHeuristic

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
Heuristic<state>* DVCBS< state, action, environment, dataStructure, priorityQueue >::forwardHeuristic
private

◆ forwardMeetingPoint

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::forwardMeetingPoint
private

◆ forwardUnnecessaryNodesInPath

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::forwardUnnecessaryNodesInPath
private

◆ goal

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
state DVCBS< state, action, environment, dataStructure, priorityQueue >::goal
private

Definition at line 214 of file DVCBS.h.

◆ isAllSolutions

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::isAllSolutions
private

◆ isLEQ

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
bool DVCBS< state, action, environment, dataStructure, priorityQueue >::isLEQ
private

◆ middleNode

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
state DVCBS< state, action, environment, dataStructure, priorityQueue >::middleNode
private

Definition at line 202 of file DVCBS.h.

◆ neighbors

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
std::vector<state> DVCBS< state, action, environment, dataStructure, priorityQueue >::neighbors
private

Definition at line 206 of file DVCBS.h.

◆ nodesExpanded

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::nodesExpanded
private

◆ nodesTouched

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
uint64_t DVCBS< state, action, environment, dataStructure, priorityQueue >::nodesTouched
private

◆ queue

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
dataStructure DVCBS< state, action, environment, dataStructure, priorityQueue >::queue
private

Definition at line 212 of file DVCBS.h.

Referenced by DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToGoal(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToGoalFromID(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToStart(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractCostToStartFromID(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToGoal(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToGoalFromID(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToStart(), DVCBS< state, action, environment, dataStructure, priorityQueue >::ExtractPathToStartFromID(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetBackwardItem(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetForwardItem(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeBackwardG(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeBackwardLocation(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeForwardG(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNodeForwardLocation(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNumBackwardItems(), DVCBS< state, action, environment, dataStructure, priorityQueue >::GetNumForwardItems(), and DVCBS< state, action, environment, dataStructure, priorityQueue >::getOptimalNumberOfExpantions().

◆ start

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
state DVCBS< state, action, environment, dataStructure, priorityQueue >::start
private

Definition at line 214 of file DVCBS.h.

◆ tieBreakingPolicy

template<class state , class action , class environment , class dataStructure = DVCBSQueue<state>, class priorityQueue = DVCBSOpenClosed<state>>
int DVCBS< state, action, environment, dataStructure, priorityQueue >::tieBreakingPolicy
private

The documentation for this class was generated from the following file: