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

#include <BidirectionalDijkstra.h>

Public Member Functions

 BIdijkstra ()
 
virtual ~BIdijkstra ()
 
void GetPath (environment *env, const state &from, const state &to, std::vector< state > &thePath)
 
bool InitializeSearch (environment *env, const state &from, const state &to, std::vector< state > &thePath)
 
bool DoSingleSearchStep (std::vector< state > &thePath)
 
void ExtractPath (uint64_t node1, uint64_t node2, std::vector< state > &thePath)
 
void DoRegionAnalysis (environment *env, const state &from, const state &to, double optimalPathCost, uint64_t optimalPathLength)
 
void SetVersion (int v)
 
int GetVersion ()
 
void SetEpsilon (double minedge)
 
double GetEpsilon ()
 
virtual const char * GetName ()
 
void ResetNodeCount ()
 
const int GetNumForwardItems ()
 
const int GetNumBackwardItems ()
 
const AStarOpenClosedData< state > & GetForwardItem (unsigned int which)
 
const AStarOpenClosedData< state > & GetBackwardItem (unsigned int which)
 
uint64_t GetNodesExpanded () const
 
uint64_t GetNodesTouched () const
 
uint64_t GetNodesExpanded_NN_PathCost () const
 
uint64_t GetNodesExpanded_NF_PathCost () const
 
uint64_t GetNodesExpanded_FN_PathCost () const
 
uint64_t GetNodesExpanded_FF_PathCost () const
 
uint64_t GetNodesExpanded_RN_PathCost () const
 
uint64_t GetNodesExpanded_RF_PathCost () const
 
uint64_t GetNodesExpanded_NN_PathLength () const
 
uint64_t GetNodesExpanded_NF_PathLength () const
 
uint64_t GetNodesExpanded_FN_PathLength () const
 
uint64_t GetNodesExpanded_FF_PathLength () const
 
uint64_t GetNodesExpanded_RN_PathLength () const
 
uint64_t GetNodesExpanded_RF_PathLength () const
 
double GetPathCost () const
 
uint64_t GetPathLength () const
 
state GetMeetingPoint () const
 
void OpenGLDraw () const
 

Public Attributes

priorityQueue forwardQueue
 
priorityQueue backwardQueue
 
state goal
 
state start
 

Private Member Functions

void OpenGLDraw (const priorityQueue &queue) const
 
void Expand (priorityQueue &current, priorityQueue &opposite, const state &target)
 

Private Attributes

uint64_t nodesTouched
 
uint64_t nodesExpanded
 
uint64_t middleNode
 
uint64_t middleNode2
 
double currentCost
 
std::vector< state > neighbors
 
environment * env
 
double epsilon
 
int turn
 
int version
 
bool countRegions
 
uint64_t nodesExpanded_NF_PathCost
 
uint64_t nodesExpanded_NN_PathCost
 
uint64_t nodesExpanded_RF_PathCost
 
uint64_t nodesExpanded_FN_PathCost
 
uint64_t nodesExpanded_FF_PathCost
 
uint64_t nodesExpanded_RN_PathCost
 
uint64_t nodesExpanded_NF_PathLength
 
uint64_t nodesExpanded_NN_PathLength
 
uint64_t nodesExpanded_RF_PathLength
 
uint64_t nodesExpanded_FN_PathLength
 
uint64_t nodesExpanded_FF_PathLength
 
uint64_t nodesExpanded_RN_PathLength
 
double optimalPathCost
 
double optimalPathLength
 
bool forwardDirection
 

Detailed Description

template<class state, class action, class environment, class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
class BIdijkstra< state, action, environment, priorityQueue >

Definition at line 25 of file BidirectionalDijkstra.h.

Constructor & Destructor Documentation

◆ BIdijkstra()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
BIdijkstra< state, action, environment, priorityQueue >::BIdijkstra ( )
inline

Definition at line 27 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::countRegions, BIdijkstra< state, action, environment, priorityQueue >::env, and BIdijkstra< state, action, environment, priorityQueue >::ResetNodeCount().

◆ ~BIdijkstra()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
virtual BIdijkstra< state, action, environment, priorityQueue >::~BIdijkstra ( )
inlinevirtual

Definition at line 28 of file BidirectionalDijkstra.h.

Member Function Documentation

◆ DoRegionAnalysis()

template<class state , class action , class environment , class priorityQueue >
void BIdijkstra< state, action, environment, priorityQueue >::DoRegionAnalysis ( environment *  env,
const state &  from,
const state &  to,
double  optimalPathCost,
uint64_t  optimalPathLength 
)

Definition at line 486 of file BidirectionalDijkstra.h.

◆ DoSingleSearchStep()

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

Definition at line 142 of file BidirectionalDijkstra.h.

References fless(), and AStarOpenClosedData< state >::g.

◆ Expand()

template<class state , class action , class environment , class priorityQueue >
void BIdijkstra< state, action, environment, priorityQueue >::Expand ( priorityQueue &  current,
priorityQueue &  opposite,
const state &  target 
)
private

Definition at line 254 of file BidirectionalDijkstra.h.

References fless(), kClosedList, kNotFound, and kOpenList.

◆ ExtractPath()

template<class state , class action , class environment , class priorityQueue >
void BIdijkstra< state, action, environment, priorityQueue >::ExtractPath ( uint64_t  node1,
uint64_t  node2,
std::vector< state > &  thePath 
)

Definition at line 234 of file BidirectionalDijkstra.h.

◆ GetBackwardItem()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
const AStarOpenClosedData<state>& BIdijkstra< state, action, environment, priorityQueue >::GetBackwardItem ( unsigned int  which)
inline

Definition at line 57 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::backwardQueue.

◆ GetEpsilon()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::GetEpsilon ( )
inline

Definition at line 39 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::epsilon.

◆ GetForwardItem()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
const AStarOpenClosedData<state>& BIdijkstra< state, action, environment, priorityQueue >::GetForwardItem ( unsigned int  which)
inline

Definition at line 55 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::forwardQueue.

◆ GetMeetingPoint()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
state BIdijkstra< state, action, environment, priorityQueue >::GetMeetingPoint ( ) const
inline

Definition at line 78 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::forwardQueue, and BIdijkstra< state, action, environment, priorityQueue >::middleNode.

◆ GetName()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
virtual const char* BIdijkstra< state, action, environment, priorityQueue >::GetName ( )
inlinevirtual

Definition at line 47 of file BidirectionalDijkstra.h.

◆ GetNodesExpanded()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded ( ) const
inline

Definition at line 59 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded.

◆ GetNodesExpanded_FF_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FF_PathCost ( ) const
inline

Definition at line 65 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FF_PathCost.

◆ GetNodesExpanded_FF_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FF_PathLength ( ) const
inline

Definition at line 72 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FF_PathLength.

◆ GetNodesExpanded_FN_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FN_PathCost ( ) const
inline

Definition at line 64 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FN_PathCost.

◆ GetNodesExpanded_FN_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FN_PathLength ( ) const
inline

Definition at line 71 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FN_PathLength.

◆ GetNodesExpanded_NF_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NF_PathCost ( ) const
inline

Definition at line 63 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NF_PathCost.

◆ GetNodesExpanded_NF_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NF_PathLength ( ) const
inline

Definition at line 70 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NF_PathLength.

◆ GetNodesExpanded_NN_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NN_PathCost ( ) const
inline

Definition at line 62 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NN_PathCost.

◆ GetNodesExpanded_NN_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NN_PathLength ( ) const
inline

Definition at line 69 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NN_PathLength.

◆ GetNodesExpanded_RF_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RF_PathCost ( ) const
inline

Definition at line 67 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RF_PathCost.

◆ GetNodesExpanded_RF_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RF_PathLength ( ) const
inline

Definition at line 74 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RF_PathLength.

◆ GetNodesExpanded_RN_PathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RN_PathCost ( ) const
inline

Definition at line 66 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RN_PathCost.

◆ GetNodesExpanded_RN_PathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RN_PathLength ( ) const
inline

Definition at line 73 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RN_PathLength.

◆ GetNodesTouched()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetNodesTouched ( ) const
inline

Definition at line 60 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesTouched.

◆ GetNumBackwardItems()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
const int BIdijkstra< state, action, environment, priorityQueue >::GetNumBackwardItems ( )
inline

Definition at line 53 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::backwardQueue.

◆ GetNumForwardItems()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
const int BIdijkstra< state, action, environment, priorityQueue >::GetNumForwardItems ( )
inline

Definition at line 51 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::forwardQueue.

◆ GetPath()

template<class state , class action , class environment , class priorityQueue >
void BIdijkstra< state, action, environment, priorityQueue >::GetPath ( environment *  env,
const state &  from,
const state &  to,
std::vector< state > &  thePath 
)

Definition at line 108 of file BidirectionalDijkstra.h.

◆ GetPathCost()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::GetPathCost ( ) const
inline

Definition at line 76 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::optimalPathCost.

◆ GetPathLength()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::GetPathLength ( ) const
inline

Definition at line 77 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::optimalPathLength.

◆ GetVersion()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
int BIdijkstra< state, action, environment, priorityQueue >::GetVersion ( )
inline

Definition at line 35 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::version.

◆ InitializeSearch()

template<class state , class action , class environment , class priorityQueue >
bool BIdijkstra< state, action, environment, priorityQueue >::InitializeSearch ( environment *  env,
const state &  from,
const state &  to,
std::vector< state > &  thePath 
)

Definition at line 119 of file BidirectionalDijkstra.h.

◆ OpenGLDraw() [1/2]

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

Definition at line 435 of file BidirectionalDijkstra.h.

◆ OpenGLDraw() [2/2]

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

Definition at line 442 of file BidirectionalDijkstra.h.

References AStarOpenClosedData< state >::data, kClosedList, kOpenList, AStarOpenClosedData< state >::reopened, and AStarOpenClosedData< state >::where.

◆ ResetNodeCount()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
void BIdijkstra< state, action, environment, priorityQueue >::ResetNodeCount ( )
inline

Definition at line 49 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded, and BIdijkstra< state, action, environment, priorityQueue >::nodesTouched.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::BIdijkstra().

◆ SetEpsilon()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
void BIdijkstra< state, action, environment, priorityQueue >::SetEpsilon ( double  minedge)
inline

Definition at line 36 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::epsilon.

◆ SetVersion()

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
void BIdijkstra< state, action, environment, priorityQueue >::SetVersion ( int  v)
inline

Definition at line 34 of file BidirectionalDijkstra.h.

References BIdijkstra< state, action, environment, priorityQueue >::version.

Member Data Documentation

◆ backwardQueue

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
priorityQueue BIdijkstra< state, action, environment, priorityQueue >::backwardQueue

Definition at line 43 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetBackwardItem(), and BIdijkstra< state, action, environment, priorityQueue >::GetNumBackwardItems().

◆ countRegions

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
bool BIdijkstra< state, action, environment, priorityQueue >::countRegions
private

Definition at line 96 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::BIdijkstra().

◆ currentCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::currentCost
private

Definition at line 90 of file BidirectionalDijkstra.h.

◆ env

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
environment* BIdijkstra< state, action, environment, priorityQueue >::env
private

Definition at line 92 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::BIdijkstra().

◆ epsilon

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::epsilon
private

Definition at line 93 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetEpsilon(), and BIdijkstra< state, action, environment, priorityQueue >::SetEpsilon().

◆ forwardDirection

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
bool BIdijkstra< state, action, environment, priorityQueue >::forwardDirection
private

Definition at line 104 of file BidirectionalDijkstra.h.

◆ forwardQueue

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
priorityQueue BIdijkstra< state, action, environment, priorityQueue >::forwardQueue

Definition at line 43 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetForwardItem(), BIdijkstra< state, action, environment, priorityQueue >::GetMeetingPoint(), and BIdijkstra< state, action, environment, priorityQueue >::GetNumForwardItems().

◆ goal

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
state BIdijkstra< state, action, environment, priorityQueue >::goal

Definition at line 44 of file BidirectionalDijkstra.h.

◆ middleNode

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::middleNode
private

Definition at line 88 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetMeetingPoint().

◆ middleNode2

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::middleNode2
private

Definition at line 89 of file BidirectionalDijkstra.h.

◆ neighbors

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
std::vector<state> BIdijkstra< state, action, environment, priorityQueue >::neighbors
private

Definition at line 91 of file BidirectionalDijkstra.h.

◆ nodesExpanded

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded
private

Definition at line 86 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded(), and BIdijkstra< state, action, environment, priorityQueue >::ResetNodeCount().

◆ nodesExpanded_FF_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FF_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FF_PathCost().

◆ nodesExpanded_FF_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FF_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FF_PathLength().

◆ nodesExpanded_FN_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FN_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FN_PathCost().

◆ nodesExpanded_FN_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_FN_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_FN_PathLength().

◆ nodesExpanded_NF_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NF_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NF_PathCost().

◆ nodesExpanded_NF_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NF_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NF_PathLength().

◆ nodesExpanded_NN_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NN_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NN_PathCost().

◆ nodesExpanded_NN_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_NN_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_NN_PathLength().

◆ nodesExpanded_RF_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RF_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RF_PathCost().

◆ nodesExpanded_RF_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RF_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RF_PathLength().

◆ nodesExpanded_RN_PathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RN_PathCost
private

Definition at line 98 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RN_PathCost().

◆ nodesExpanded_RN_PathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesExpanded_RN_PathLength
private

Definition at line 100 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesExpanded_RN_PathLength().

◆ nodesTouched

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
uint64_t BIdijkstra< state, action, environment, priorityQueue >::nodesTouched
private

Definition at line 86 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetNodesTouched(), and BIdijkstra< state, action, environment, priorityQueue >::ResetNodeCount().

◆ optimalPathCost

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::optimalPathCost
private

Definition at line 102 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetPathCost().

◆ optimalPathLength

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
double BIdijkstra< state, action, environment, priorityQueue >::optimalPathLength
private

Definition at line 103 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetPathLength().

◆ start

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
state BIdijkstra< state, action, environment, priorityQueue >::start

Definition at line 44 of file BidirectionalDijkstra.h.

◆ turn

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
int BIdijkstra< state, action, environment, priorityQueue >::turn
private

Definition at line 94 of file BidirectionalDijkstra.h.

◆ version

template<class state , class action , class environment , class priorityQueue = AStarOpenClosed<state,BDCompare<state>>>
int BIdijkstra< state, action, environment, priorityQueue >::version
private

Definition at line 95 of file BidirectionalDijkstra.h.

Referenced by BIdijkstra< state, action, environment, priorityQueue >::GetVersion(), and BIdijkstra< state, action, environment, priorityQueue >::SetVersion().

The documentation for this class was generated from the following file:
Generated by   doxygen 1.8.17