| algName | praStar | [protected] |
| astar(graph *g, unsigned int source, unsigned int destParent, std::vector< unsigned int > &eligibleNodeParents, int LABEL, unsigned int dest) | praStar | [protected] |
| cache | praStar | [protected] |
| expandSearchRadius | praStar | [protected] |
| fixedPlanLevel | praStar | [protected] |
| getAbstractPath(graph *g, unsigned int source, unsigned int destParent, std::vector< unsigned int > &eligibleNodeParents, int LABEL, unsigned int dest) | praStar | [protected] |
| getAbstractPathLengths(std::vector< int > &len) | praStar | [inline] |
| getName() | praStar | [inline, virtual] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getPartialPathLimit() | praStar | [inline] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) | praStar | [virtual] |
| lengths | praStar | [protected] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| map | praStar | [protected] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| partialLimit | praStar | [protected] |
| planFromMiddle | praStar | [protected] |
| praStar() | praStar | |
| relaxEdge(heap *nodeHeap, graph *g, edge *e, int source, int nextNode, int dest, int LABEL) | praStar | [protected] |
| rp | praStar | [protected] |
| searchAlgorithm() | searchAlgorithm | [inline] |
| setCache(path **p) | praStar | |
| setExpandSearchRadius(bool _expandSearchRadius) | praStar | [inline] |
| setFixedPlanLevel(int p) | praStar | [inline] |
| setPartialPathLimit(int limit) | praStar | [inline] |
| setPlanFromMiddle(bool _planFromMiddle) | praStar | [inline] |
| setUseSmoothing(bool _smoothing) | praStar | [inline] |
| smoothing | praStar | [protected] |
| smoothPath(path *p) | praStar | [protected] |
| ~praStar() | praStar | [inline, virtual] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
