HOG2
FringeSearch Member List

This is the complete list of members for FringeSearch, including all inherited members.

addCosts(node *n, node *parent, edge *e)FringeSearchprivate
addToClosedList(node *n)FringeSearchprivate
addToOpenList(node *n)FringeSearchprivate
addToOpenList2(node *n)FringeSearchprivate
aMapFringeSearchprivate
bpmxFringeSearchprivate
checkIteration()FringeSearchprivate
closedListFringeSearchprivate
costTableFringeSearchprivate
currFLimitFringeSearchprivate
currListFringeSearchprivate
extractBestPath(node *n)FringeSearchprivate
FringeSearch()FringeSearch
gFringeSearchprivate
getCosts(node *n, costs &val)FringeSearchprivate
getFCost(node *n)FringeSearchprivate
getGCost(node *n)FringeSearchprivate
getHCost(node *n)FringeSearchprivate
getHValuesPropagated()FringeSearchinline
GetName()FringeSearchinlinevirtual
GetNodesExpanded()SearchAlgorithminline
getNodesReopened()FringeSearchinline
GetNodesTouched()SearchAlgorithminline
GetPath(GraphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0)FringeSearchvirtual
goalFringeSearchprivate
h(node *n1, node *n2)FringeSearchprivate
hpFringeSearchprivate
initializeSearch(GraphAbstraction *aGraph, node *from, node *to)FringeSearchprivate
list1FringeSearchprivate
list2FringeSearchprivate
LogFinalStats(StatCollection *)SearchAlgorithminlinevirtual
moveToOpenList1(node *n)FringeSearchprivate
nextFLimitFringeSearchprivate
nextListFringeSearchprivate
nodesExpandedSearchAlgorithm
nodesHPropagatedFringeSearchprivate
nodesReopenedFringeSearchprivate
nodesTouchedSearchAlgorithm
onClosedList(node *n)FringeSearchprivate
onOpenList(node *n)FringeSearchprivate
propagateGValues(node *n)FringeSearchprivate
propagateHValues(node *n, int dist=10000)FringeSearchprivate
SearchAlgorithm()SearchAlgorithminline
setHCost(node *n, double val)FringeSearchprivate
setHeuristicProvider(heuristicProvider *hh)FringeSearchinline
setUseBPMX(bool use)FringeSearchinline
updateCosts(node *n, node *parent, edge *e)FringeSearchprivate
~SearchAlgorithm()SearchAlgorithminlinevirtual