This class represents a Node which can be connected to other neighboring nodes. Node sets can be searched using
search algorithms. Typically the search algorithm only requires one starting node and one goal node. It assumes these
nodes are linked by intermediate nodes.
Removes a node from this node as neighbors, effectively disconnecting them. Note: You have to remove
this node from the neighbor, and also remove the neighbor from this node. This method doesn't do both.
neighbor - The neighboring node to disconnect from.
Returns false if the neighbor did not previously exist as a neighbor.
protected void setH_Score(float h)
Method used by A* to calculate search score. The H score is the estimated distance to the goal node from this node.
It can either be distance "as the crow flies" or in the case of a grid navigation mesh, the minimum number
of grid spaces to get to the goal node (x squares horizontally + y squares vertically from goal).
NOTE: There is no getH_score() because the A* algorithm only needs to set this value, not retrieve it.