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

Contains useful functions for working with paths and nodes. More...
Contains useful functions for working with paths and nodes.
This class works a lot with the Node class, a useful function to get nodes is AstarPath.GetNearest.
Static Public Member Functions  
static List< GraphNode >  BFS (GraphNode seed, int depth, int tagMask=1) 
Returns all nodes up to a given nodedistance from the seed node.  
static void  GetPointsAroundPoint (Vector3 p, IRaycastableGraph g, List< Vector3 > previousPoints, float radius, float clearanceRadius) 
Will calculate a number of points around p which are on the graph and are separated by clearance from each other.  
static void  GetPointsAroundPointWorld (Vector3 p, IRaycastableGraph g, List< Vector3 > previousPoints, float radius, float clearanceRadius) 
Will calculate a number of points around p which are on the graph and are separated by clearance from each other.  
static List< Vector3 >  GetPointsOnNodes (List< GraphNode > nodes, int count, float clearanceRadius=0) 
Returns randomly selected points on the specified nodes with each point being separated by clearanceRadius from each other.  
static List< GraphNode >  GetReachableNodes (GraphNode seed, int tagMask=1) 
Returns all nodes reachable from the seed node.  
static List< Vector3 >  GetSpiralPoints (int count, float clearance) 
Returns points in a spiral centered around the origin with a minimum clearance from other points.  
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  IsPathPossible (List< GraphNode > nodes, int tagMask) 
Returns if there are walkable paths between all nodes.  
Static Private Member Functions  
static Vector3  InvoluteOfCircle (float a, float t) 
Returns the XZ coordinate of the involute of circle.  
Static Private Attributes  
static Dictionary< GraphNode, int >  BFSMap 
static Queue< GraphNode >  BFSQueue 
Returns all nodes up to a given nodedistance from the seed node.
This function performs a BFS (breadthfirstsearch) or flood fill of the graph and returns all nodes within a specified node distance which can be reached from the seed node. In almost all cases when depth is large enough this will be identical to returning all nodes which have the same area as the seed node. In the editor areas are displayed as different colors of the nodes. The only case where it will not be so is when there is a one way path from some part of the area to the seed node but no path from the seed node to that part of the graph.
The returned list is sorted by node distance from the seed node i.e distance is measured in the number of nodes the shortest path from seed to that node would pass through. Note that the distance measurement does not take heuristics, penalties or tag penalties.
Depending on the number of nodes, this function can take quite some time to calculate so don't use it too often or it might affect the framerate of your game.
seed  The node to start the search from. 
depth  The maximum nodedistance from the seed node. 
tagMask  Optional mask for tags. This is a bitmask. 

static 
Will calculate a number of points around p which are on the graph and are separated by clearance from each other.
The maximum distance from p to any point will be radius. Points will first be tried to be laid out as previousPoints and if that fails, random points will be selected. This is great if you want to pick a number of target points for group movement. If you pass all current agent points from e.g the group's average position this method will return target points so that the units move very little within the group, this is often aesthetically pleasing and reduces jitter if using some kind of local avoidance.
p  The point to generate points around 
g  The graph to use for linecasting. If you are only using one graph, you can get this by AstarPath.active.graphs[0] as IRaycastableGraph. Note that not all graphs are raycastable, recast, navmesh and grid graphs are raycastable. On recast and navmesh it works the best. 
previousPoints  The points to use for reference. Note that these should not be in world space. They are treated as relative to p. The new points will overwrite the existing points in the list. The result will be in world space, not relative to p. 
radius  The final points will be at most this distance from p. 
clearanceRadius  The points will if possible be at least this distance from each other. 

static 
Will calculate a number of points around p which are on the graph and are separated by clearance from each other.
This is like GetPointsAroundPoint except that previousPoints are treated as being in world space. The average of the points will be found and then that will be treated as the group center.
p  The point to generate points around 
g  The graph to use for linecasting. If you are only using one graph, you can get this by AstarPath.active.graphs[0] as IRaycastableGraph. Note that not all graphs are raycastable, recast, navmesh and grid graphs are raycastable. On recast and navmesh it works the best. 
previousPoints  The points to use for reference. Note that these are in world space. The new points will overwrite the existing points in the list. The result will be in world space. 
radius  The final points will be at most this distance from p. 
clearanceRadius  The points will if possible be at least this distance from each other. 

static 
Returns randomly selected points on the specified nodes with each point being separated by clearanceRadius from each other.
Selecting points ON the nodes only works for TriangleMeshNode (used by Recast Graph and Navmesh Graph) and GridNode (used by GridGraph). For other node types, only the positions of the nodes will be used.
clearanceRadius will be reduced if no valid points can be found.
Returns all nodes reachable from the seed node.
This function performs a BFS (breadthfirstsearch) or flood fill of the graph and returns all nodes which can be reached from the seed node. In almost all cases this will be identical to returning all nodes which have the same area as the seed node. In the editor areas are displayed as different colors of the nodes. The only case where it will not be so is when there is a one way path from some part of the area to the seed node but no path from the seed node to that part of the graph.
The returned list is sorted by node distance from the seed node i.e distance is measured in the number of nodes the shortest path from seed to that node would pass through. Note that the distance measurement does not take heuristics, penalties or tag penalties.
Depending on the number of reachable nodes, this function can take quite some time to calculate so don't use it too often or it might affect the framerate of your game.
seed  The node to start the search from 
tagMask  Optional mask for tags. This is a bitmask. 

static 
Returns points in a spiral centered around the origin with a minimum clearance from other points.
The points are laid out on the involute of a circle

staticprivate 
Returns the XZ coordinate of the involute of circle.
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()

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()
Returns true for empty lists

static 
Returns if there are walkable paths between all nodes.
If you are making changes to the graph, areas should first be recaculated using FloodFill()
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

staticprivate 

staticprivate 