A* Pathfinding Project
3.8.2
The A* Pathfinding Project for Unity 3D

Contains useful functions for updating graphs. More...
Contains useful functions for updating graphs.
This class works a lot with the Node class, a useful function to get nodes is AstarPath.GetNearest.
Static Public Member Functions  
static bool  UpdateGraphsNoBlock (GraphUpdateObject guo, GraphNode node1, GraphNode node2, bool alwaysRevert=false) 
Updates graphs and checks if all nodes are still reachable from each other.  
static bool  UpdateGraphsNoBlock (GraphUpdateObject guo, List< GraphNode > nodes, bool alwaysRevert=false) 
Updates graphs and checks if all nodes are still reachable from each other.  

static 
Updates graphs and checks if all nodes are still reachable from each other.
Graphs are updated, then a check is made to see if the nodes are still reachable from each other. If they are not, the graphs are reverted to before the update and false is returned.
This is slower than a normal graph update. All queued graph updates and thread safe callbacks will be flushed during this function.
guo  The GraphUpdateObject to update the graphs with 
node1  Node which should have a valid path to node2. All nodes should be walkable or false will be returned. 
node2  Node which should have a valid path to node1. All nodes should be walkable or false will be returned. 
alwaysRevert  If true, reverts the graphs to the old state even if no blocking ocurred 

static 
Updates graphs and checks if all nodes are still reachable from each other.
Graphs are updated, then a check is made to see if the nodes are still reachable from each other. If they are not, the graphs are reverted to before the update and false is returned. This is slower than a normal graph update. All queued graph updates and thread safe callbacks will be flushed during this function.
guo  The GraphUpdateObject to update the graphs with 
nodes  Nodes which should have valid paths between them. All nodes should be walkable or false will be returned. 
alwaysRevert  If true, reverts the graphs to the old state even if no blocking ocurred 