|
| void | Link (Node node, int index) |
| | Links this NodeRun with the specified node.
|
| |
|
void | Reset () |
| |
|
|
uint | cost |
| |
| uint | g |
| | G score of this node.
|
| |
| uint | h |
| | H score for this node.
|
| |
|
NodeRun | parent |
| |
|
ushort | pathID |
| |
|
| uint | f [get] |
| | F score.
|
| |
|
Node | node [get, set] |
| |
| void Link |
( |
Node |
node, |
|
|
int |
index |
|
) |
| |
Links this NodeRun with the specified node.
- Parameters
-
G score of this node.
The G score is the total cost from the start to this node.
H score for this node.
The H score is the estimated cost from this node to the end.
F score.
The F score is the g score + h score, that is the cost it taken to move to this node from the start + the estimated cost to move to the end node.
Nodes are sorted by their F score, nodes with lower F scores are opened first
The documentation for this class was generated from the following file:
- /Users/aron/Unity/AstarPathfindingGIT/Assets/AstarPathfindingProject/Core/MultithreadClasses.cs