Method | Description | |
---|---|---|
FindPath ( IMap map, int start, int target ) : |
Performs an A* search following the Node Array A* implementation
|
|
FindPath ( IMap map, int start, int target ) : bool |
Method | Description | |
---|---|---|
FindPathAstar ( int start ) : void | ||
ProcessNeighbours ( int nodeId, |
Processes every open or unexplored successor of nodeId
|
|
ReconstructPath ( int destination, |
Reconstructs the path from the destination node with the aid of the node Lookup that stored the states of all processed nodes TODO: Maybe I should guard this with some kind of safetyGuard to prevent possible infinite loops in case of bugs, but meh...
|
|
ReconstructPath ( int destination ) : void |
public FindPath ( IMap map, int start, int target ) : |
||
map | IMap | |
start | int | |
target | int | |
return |
public FindPath ( IMap map, int start, int target ) : bool | ||
map | IMap | |
start | int | |
target | int | |
return | bool |