| backwardHeuristic | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| backwardMeetingPoint | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| backwardUnnecessaryNodesInPath | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| counts | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| currentCost | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| currentPr | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| currentSolutionEstimate | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| DoSingleSearchStep(std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| DVCBS(int tieBreaking, bool allSolutions=false, bool leq=false) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| DVCBS(bool allSolutions=false, bool leq=false) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| env | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| Expand(uint64_t nextID, priorityQueue ¤t, priorityQueue &opposite, Heuristic< state > *heuristic, const state &target) | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| expand | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ExpandAVertexCover(std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| expansionsUntilSolution | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ExtractCostFromMiddle() | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ExtractCostToGoal(state &node) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractCostToGoalFromID(uint64_t node) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractCostToStart(state &node) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractCostToStartFromID(uint64_t node) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractFromMiddle(std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ExtractPathToGoal(state &node, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractPathToGoalFromID(uint64_t node, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractPathToStart(state &node, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| ExtractPathToStartFromID(uint64_t node, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlineprivate |
| forwardHeuristic | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| forwardMeetingPoint | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| forwardUnnecessaryNodesInPath | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| GetBackwardItem(unsigned int which) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| getBackwardMeetingPoint() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| getBackwardUnnecessaryNodesInPath() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetDoubleExpansions() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| GetExpansionUntilFirstSolution() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetForwardItem(unsigned int which) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| getForwardMeetingPoint() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| getForwardUnnecessaryNodesInPath() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetName() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlinevirtual |
| GetNecessaryExpansions() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodeBackwardG(const state &s) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodeBackwardLocation(const state &s) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodeForwardG(const state &s) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodeForwardLocation(const state &s) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodesExpanded() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNodesTouched() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNumBackwardItems() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetNumForwardItems() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| getOptimalNumberOfExpantions() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| GetPath(environment *env, const state &from, const state &to, Heuristic< state > *forward, Heuristic< state > *backward, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| GetSolutionCost() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| goal | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| InitializeSearch(environment *env, const state &from, const state &to, Heuristic< state > *forward, Heuristic< state > *backward, std::vector< state > &thePath) | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| isAllSolutions | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| isLEQ | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| middleNode | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| neighbors | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| nodesExpanded | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| nodesTouched | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| OpenGLDraw() const | DVCBS< state, action, environment, dataStructure, priorityQueue > | |
| OpenGLDraw(const priorityQueue &queue) const | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| queue | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ResetNodeCount() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| SetBackwardHeuristic(Heuristic< state > *h) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| SetForwardHeuristic(Heuristic< state > *h) | DVCBS< state, action, environment, dataStructure, priorityQueue > | inline |
| start | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| tieBreakingPolicy | DVCBS< state, action, environment, dataStructure, priorityQueue > | private |
| ~DVCBS() | DVCBS< state, action, environment, dataStructure, priorityQueue > | inlinevirtual |
