| absLevel | craStar | [protected] |
| algName | craStar | [protected] |
| backTwoNodes(int i, std::vector< node * > lookup) | craStar | [protected] |
| BEGIN enum value | craStar | |
| buildAbstractPath(graphAbstraction *aMap, std::vector< node * > &fromChain, std::vector< node * > &toChain, reservationProvider *rp) | craStar | [protected] |
| buildNextAbstractPath(graphAbstraction *, path *lastPath, std::vector< node * > &fromChain, std::vector< node * > &toChain, reservationProvider *) | craStar | [protected] |
| cAStar | craStar | [protected] |
| craStar() | craStar | |
| Direction enum name | craStar | |
| doRefinement(graphAbstraction *aMap, path *absPath, std::vector< node * > &fromChain, std::vector< node * > &toChain) | craStar | [protected] |
| EAST enum value | craStar | |
| END enum value | craStar | |
| expandSearchRadius | craStar | [protected] |
| findGoalNode(graphAbstraction *aMap, node *n, std::vector< node * > &toChain) | craStar | [protected] |
| findMinMax(path *p) | craStar | [protected] |
| getName() | craStar | [inline, virtual] |
| getNextNode(graphAbstraction *aMap, node *currentLow, path *returnPath, path *apath, graph *g, int abstractLevel) | craStar | [protected] |
| getNextNode(mapAbstraction *m, int x, int y, int dir) | craStar | [protected] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getPartialPathLimit() | craStar | [inline] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) | craStar | [virtual] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| lookup | craStar | [protected] |
| maxx | craStar | [protected] |
| maxy | craStar | [protected] |
| minx | craStar | [protected] |
| miny | craStar | [protected] |
| NE enum value | craStar | |
| nextInLookup(int last, int curr, std::vector< node * > lookup) | craStar | [protected] |
| nextPathNode(graphAbstraction *m, node *n, int dir) | craStar | [protected] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| NORTH enum value | craStar | |
| NW enum value | craStar | |
| partialLimit | craStar | [protected] |
| SE enum value | craStar | |
| searchAlgorithm() | searchAlgorithm | [inline] |
| setAbstractLevel(int level) | craStar | [inline] |
| setPartialPathLimit(int limit) | craStar | [inline] |
| setSmoothing(bool smooth) | craStar | [inline] |
| setSmoothType(SmoothType s) | craStar | [inline] |
| setupSearch(graphAbstraction *aMap, std::vector< node * > &fromChain, node *from, std::vector< node * > &toChain, node *to) | craStar | [protected] |
| smoothing | craStar | [protected] |
| smoothPath(graphAbstraction *m, path *p) | craStar | [protected] |
| SmoothType enum name | craStar | |
| smType | craStar | [protected] |
| SOUTH enum value | craStar | |
| SW enum value | craStar | |
| trimPath(path *lastPath, node *origDest) | craStar | [protected] |
| TWO_BACK enum value | craStar | |
| WEST enum value | craStar | |
| ~craStar() | craStar | [inline, virtual] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
