| corridor | corridorAStar | [private] |
| corridorAStar() | corridorAStar | |
| emptyCorridor | corridorAStar | [private] |
| extractBestPath(graph *g, unsigned int current) | corridorAStar | [private] |
| getBestPath(graphAbstraction *aMap, node *from, node *to, node *hGoal, reservationProvider *rp=0) | corridorAStar | |
| getBestPath(graphAbstraction *aMap, node *afrom, node *ato, node *from, node *to, reservationProvider *rp=0) | corridorAStar | |
| getName() | corridorAStar | [inline, virtual] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) | corridorAStar | [virtual] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| relaxEdge(heap *nodeHeap, graph *g, graphAbstraction *aMap, edge *e, node *from, node *to, node *dest) | corridorAStar | [private] |
| relaxFinalEdge(heap *nodeHeap, graph *g, graphAbstraction *aMap, edge *e, node *from, node *to, node *realDest) | corridorAStar | [private] |
| relaxFirstEdge(heap *nodeHeap, graph *g, graphAbstraction *aMap, edge *e, node *from, node *afrom, node *ato, node *dest) | corridorAStar | [private] |
| searchAlgorithm() | searchAlgorithm | [inline] |
| setCorridor(const std::vector< node * > *) | corridorAStar | |
| ~corridorAStar() | corridorAStar | [inline, virtual] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
