Contains useful functions for updating graphs. More...

Detailed Description

Contains useful functions for updating graphs.

This class works a lot with the Node class, a useful function to get nodes is AstarPath.GetNearest.

See Also: AstarPath.GetNearest; Pathfinding.Utils.PathUtilities

Since: Added in 3.1

Static Public Member Functions
static bool	IsPathPossible (GraphNode n1, GraphNode n2)
	Returns if there is a walkable path from n1 to n2.

static bool	IsPathPossible (List< GraphNode > nodes)
	Returns if there are walkable paths between all nodes.

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.

Member Function Documentation

static bool IsPathPossible	(	GraphNode	n1,
		GraphNode	n2
	)

static

Returns if there is a walkable path from n1 to n2.

If you are making changes to the graph, areas must first be recaculated using FloodFill()

Note: This might return true for small areas even if there is no possible path if AstarPath.minAreaSize is greater than zero (0). So when using this, it is recommended to set AstarPath.minAreaSize to 0. (A* Inspector -> Settings -> Pathfinding)

See Also: AstarPath.GetNearest

Deprecated:: This function has been moved to Pathfinding.Util.PathUtilities. Please use the version in that class

static bool IsPathPossible ( List< GraphNode > nodes )

static

Returns if there are walkable paths between all nodes.

If you are making changes to the graph, areas must first be recaculated using FloodFill()

Note: This might return true for small areas even if there is no possible path if AstarPath.minAreaSize is greater than zero (0). So when using this, it is recommended to set AstarPath.minAreaSize to 0. (A* Inspector -> Settings -> Pathfinding)

See Also: AstarPath.GetNearest

Deprecated:: This function has been moved to Pathfinding.Util.PathUtilities. Please use the version in that class

static bool UpdateGraphsNoBlock	(	GraphUpdateObject	guo,
		GraphNode	node1,
		GraphNode	node2,
		bool	alwaysRevert = `false`
	)

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.

Note: This might return true for small areas even if there is no possible path if AstarPath.minAreaSize is greater than zero (0). So when using this, it is recommended to set AstarPath.minAreaSize to 0 (A* Inspector -> Settings -> Pathfinding)

Parameters

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

Returns: True if the given nodes are still reachable from each other after the guo has been applied. False otherwise.

var guo = new GraphUpdateObject (tower.GetComponent<Collider>.bounds);
var spawnPointNode = AstarPath.active.GetNearest (spawnPoint.position).node;
var goalNode = AstarPath.active.GetNearest (goalNode.position).node;
if (GraphUpdateUtilities.UpdateGraphsNoBlock (guo, spawnPointNode, goalNode, false)) {
    // Valid tower position
    // Since the last parameter (which is called "alwaysRevert") in the method call was false
    // The graph is now updated and the game can just continue
} else {
    // Invalid tower position. It blocks the path between the spawn point and the goal
    // The effect on the graph has been reverted
    Destroy (tower);
}

static bool UpdateGraphsNoBlock	(	GraphUpdateObject	guo,
		List< GraphNode >	nodes,
		bool	alwaysRevert = `false`
	)

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.

Note: This might return true for small areas even if there is no possible path if AstarPath.minAreaSize is greater than zero (0). So when using this, it is recommended to set AstarPath.minAreaSize to 0. (A* Inspector -> Settings -> Pathfinding)

Parameters

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

Returns: True if the given nodes are still reachable from each other after the guo has been applied. False otherwise.

The documentation for this class was generated from the following file:

/Users/arong/Unity/a-pathfinding-project/Assets/AstarPathfindingProject/Utilities/GraphUpdateUtilities.cs

Detailed Description

Static Public Member Functions

Member Function Documentation