Function PathUtilities.IsPathPossible

bool IsPathPossible (

GraphNode	node1
GraphNode	node2

)

Returns if there is a walkable path from node1 to node2.

This method is extremely fast because it only uses precalculated information.

GraphNode node1 = AstarPath.active.GetNearest(point1, NNConstraint.Walkable).node;
GraphNode node2 = AstarPath.active.GetNearest(point2, NNConstraint.Walkable).node;

if (PathUtilities.IsPathPossible(node1, node2)) {
// Yay, there is a path between those two nodes
}
Equivalent to calling IsPathPossible(List<GraphNode>) with a list containing node1 and node2.

bool IsPathPossible (

List<GraphNode>

nodes

)

Returns if there are walkable paths between all nodes in the list.

Returns true for empty lists.

bool IsPathPossible (

List<GraphNode>	nodes
int	tagMask

)

Returns if there are walkable paths between all nodes in the list.

This method will actually only check if the first node can reach all other nodes. However this is equivalent in 99% of the cases since almost always the graph connections are bidirectional. If you are not aware of any cases where you explicitly create unidirectional connections this method can be used without worries.

Returns true for empty lists