HOG2
abstractionalgorithms
SpreadExecSearchAlgorithm.cpp
Go to the documentation of this file.
1
/*
2
* $Id: spreadExecSearchAlgorithm.cpp
3
* hog2
4
*
5
* Created by Nathan Sturtevant on 6/27/05.
6
* Modified by Nathan Sturtevant on 02/29/20.
7
*
8
* This file is part of HOG2. See https://github.com/nathansttt/hog2 for licensing information.
9
*
10
*/
11
12
#include "
SpreadExecSearchAlgorithm.h
"
13
14
path
*
spreadExecSearchAlgorithm::GetPath
(
GraphAbstraction
*_aMap,
node
*from,
node
*to,
reservationProvider
*_rp)
15
{
16
setTargets
(_aMap, from, to, _rp);
17
path
*p;
18
while
((p =
think
()) == 0) {}
19
return
p;
20
}
21
GraphAbstraction
A generic class for basic operations on Graph abstractions.
Definition:
GraphAbstraction.h:63
spreadExecSearchAlgorithm::GetPath
virtual path * GetPath(GraphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0)
Definition:
SpreadExecSearchAlgorithm.cpp:14
spreadExecSearchAlgorithm::think
virtual path * think()=0
do next processing for path, returns avaliability of path moves
spreadExecSearchAlgorithm::setTargets
virtual void setTargets(GraphAbstraction *_aMap, node *s, node *e, reservationProvider *_rp=0)
Definition:
SpreadExecSearchAlgorithm.h:23
reservationProvider
Definition:
ReservationProvider.h:33
path
A linked list of nodes which form a continuous path.
Definition:
Path.h:20
SpreadExecSearchAlgorithm.h
node
Nodes to be stored within a Graph.
Definition:
Graph.h:170
Generated by
1.8.17