Go to the documentation of this file.
14 #ifndef SPREADEXECSEARCHALGORITHM_H
15 #define SPREADEXECSEARCHALGORITHM_H
20 virtual const char *
GetName() {
return "unnamed"; }
A generic class for basic operations on Graph abstractions.
virtual path * GetPath(GraphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0)
virtual path * think()=0
do next processing for path, returns avaliability of path moves
spreadExecSearchAlgorithm()
virtual int getNumThinkSteps()=0
how many times do we have to "think" to find the solution, return -1 if unknown
virtual void setTargets(GraphAbstraction *_aMap, node *s, node *e, reservationProvider *_rp=0)
virtual const char * GetName()
A generic algorithm which can be used for pathfinding.
A linked list of nodes which form a continuous path.
Nodes to be stored within a Graph.