| algName | spreadPRAStar | [private] |
| aMap | spreadExecSearchAlgorithm | [protected] |
| buildNextAbstractPath(graphAbstraction *, path *lastPath, std::vector< node * > &fromChain, std::vector< node * > &toChain, reservationProvider *) | spreadPRAStar | [private] |
| cAStar | spreadPRAStar | [private] |
| end | spreadExecSearchAlgorithm | [protected] |
| endChain | spreadPRAStar | [private] |
| expandSearchRadius | spreadPRAStar | [private] |
| getName() | spreadExecSearchAlgorithm | [inline, virtual] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getNumThinkSteps() | spreadPRAStar | [virtual] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) | spreadPRAStar | [virtual] |
| lastPath | spreadPRAStar | [private] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| partialLimit | spreadPRAStar | [private] |
| rp | spreadExecSearchAlgorithm | [protected] |
| searchAlgorithm() | searchAlgorithm | [inline] |
| setPartialPathLimit(int limit) | spreadPRAStar | [inline] |
| setTargets(graphAbstraction *, node *, node *, reservationProvider *) | spreadPRAStar | [virtual] |
| setupSearch(graphAbstraction *aMap, std::vector< node * > &fromChain, node *from, std::vector< node * > &toChain, node *to) | spreadPRAStar | [private] |
| spreadExecSearchAlgorithm() | spreadExecSearchAlgorithm | [inline] |
| spreadPRAStar() | spreadPRAStar | |
| start | spreadExecSearchAlgorithm | [protected] |
| startChain | spreadPRAStar | [private] |
| think() | spreadPRAStar | [virtual] |
| trimPath(path *lastPath, node *origDest) | spreadPRAStar | [private] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
| ~spreadPRAStar() | spreadPRAStar | [inline, virtual] |
