| algName | praStar2 | [protected] |
| buildNextAbstractPath(graphAbstraction *, path *lastPath, std::vector< node * > &fromChain, std::vector< node * > &toChain, reservationProvider *) | praStar2 | [protected] |
| cAStar | praStar2 | [protected] |
| enhancedAbstractPathing | praStar2 | [protected] |
| expandSearchRadius | praStar2 | [protected] |
| fixedPlanLevel | praStar2 | [protected] |
| getName() | praStar2 | [inline, virtual] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getNumLevelsUsed() | praStar2 | [inline] |
| getPartialPathLimit() | praStar2 | [inline] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) | praStar2 | [virtual] |
| getTopLevel() | praStar2 | [inline] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| numLevels | praStar2 | [protected] |
| partialLimit | praStar2 | [protected] |
| planFromMiddle | praStar2 | [protected] |
| praStar2() | praStar2 | |
| searchAlgorithm() | searchAlgorithm | [inline] |
| selectTopAbstractionLevel(graphAbstraction *aMap, std::vector< node * > &fromChain, std::vector< node * > &toChain) | praStar2 | [protected] |
| setEnhancedAbstractPathing(bool enhance) | praStar2 | [inline] |
| setExpandSearchRadius(bool _expandSearchRadius) | praStar2 | [inline] |
| setFixedPlanLevel(int p) | praStar2 | [inline] |
| setPartialPathLimit(int limit) | praStar2 | [inline] |
| setPlanFromMiddle(bool _planFromMiddle) | praStar2 | [inline] |
| setSkipParameter(int _skip) | praStar2 | [inline] |
| setupSearch(graphAbstraction *aMap, std::vector< node * > &fromChain, node *from, std::vector< node * > &toChain, node *to) | praStar2 | [protected] |
| skip | praStar2 | [protected] |
| topLevel | praStar2 | [protected] |
| trimPath(path *lastPath, node *origDest) | praStar2 | [protected] |
| ~praStar2() | praStar2 | [inline, virtual] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
