Function Seeker.StartMultiTargetPath

MultiTargetPath StartMultiTargetPath (

Vector3	start	The start point of the path
Vector3[]	endPoints	The end points of the path
bool	pathsForAll	Indicates whether or not a path to all end points should be searched for or only to the closest one
OnPathDelegate	callback	The function to call when the path has been calculated. If you don't want a callback (e.g. if you instead poll path.IsDone or use a similar method) you can set this to null.

)

Starts a Multi Target Path from one start point to multiple end points.

A Multi Target Path will search for all the end points in one search and will return all paths if pathsForAll is true, or only the shortest one if pathsForAll is false.
callback will be called when the path has completed. Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed)

var endPoints = new Vector3[] {
transform.position + Vector3.forward * 5,
transform.position + Vector3.right * 10,
transform.position + Vector3.back * 15
};
// Start a multi target path, where endPoints is a Vector3[] array.
// The pathsForAll parameter specifies if a path to every end point should be searched for
// or if it should only try to find the shortest path to any end point.
var path = seeker.StartMultiTargetPath(transform.position, endPoints, pathsForAll: true, callback: null);
path.BlockUntilCalculated();

if (path.error) {
Debug.LogError("Error calculating path: " + path.errorLog);
return;
}

Debug.Log("The closest target was index " + path.chosenTarget);

// Draw the path to all targets
foreach (var subPath in path.vectorPaths) {
for (int i = 0; i < subPath.Count - 1; i++) {
Debug.DrawLine(subPath[i], subPath[i+1], Color.green, 10);
}
}

// Draw the path to the closest target
for (int i = 0; i < path.vectorPath.Count - 1; i++) {
Debug.DrawLine(path.vectorPath[i], path.vectorPath[i+1], Color.red, 10);
}


MultiTargetPath StartMultiTargetPath (

Vector3	start	The start point of the path
Vector3[]	endPoints	The end points of the path
bool	pathsForAll	Indicates whether or not a path to all end points should be searched for or only to the closest one
OnPathDelegate	callback	The function to call when the path has been calculated. If you don't want a callback (e.g. if you instead poll path.IsDone or use a similar method) you can set this to null.
GraphMask	graphMask	Mask used to specify which graphs should be searched for close nodes. See TraversalConstraint.graphMask. This will override the graphMask on this Seeker.

)

Starts a Multi Target Path from one start point to multiple end points.

A Multi Target Path will search for all the end points in one search and will return all paths if pathsForAll is true, or only the shortest one if pathsForAll is false.
callback will be called when the path has completed. Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed)

var endPoints = new Vector3[] {
transform.position + Vector3.forward * 5,
transform.position + Vector3.right * 10,
transform.position + Vector3.back * 15
};
// Start a multi target path, where endPoints is a Vector3[] array.
// The pathsForAll parameter specifies if a path to every end point should be searched for
// or if it should only try to find the shortest path to any end point.
var path = seeker.StartMultiTargetPath(transform.position, endPoints, pathsForAll: true, callback: null);
path.BlockUntilCalculated();

if (path.error) {
Debug.LogError("Error calculating path: " + path.errorLog);
return;
}

Debug.Log("The closest target was index " + path.chosenTarget);

// Draw the path to all targets
foreach (var subPath in path.vectorPaths) {
for (int i = 0; i < subPath.Count - 1; i++) {
Debug.DrawLine(subPath[i], subPath[i+1], Color.green, 10);
}
}

// Draw the path to the closest target
for (int i = 0; i < path.vectorPath.Count - 1; i++) {
Debug.DrawLine(path.vectorPath[i], path.vectorPath[i+1], Color.red, 10);
}


MultiTargetPath StartMultiTargetPath (

Vector3[]	startPoints	The start points of the path
Vector3	end	The end point of the path
bool	pathsForAll	Indicates whether or not a path from all start points should be searched for or only to the closest one
OnPathDelegate	callback	The function to call when the path has been calculated. If you don't want a callback (e.g. if you instead poll path.IsDone or use a similar method) you can set this to null.

)

Starts a Multi Target Path from multiple start points to a single target point.

A Multi Target Path will search from all start points to the target point in one search and will return all paths if pathsForAll is true, or only the shortest one if pathsForAll is false.
callback will be called when the path has completed. Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed)

MultiTargetPath StartMultiTargetPath (

Vector3[]	startPoints	The start points of the path
Vector3	end	The end point of the path
bool	pathsForAll	Indicates whether or not a path from all start points should be searched for or only to the closest one
OnPathDelegate	callback	The function to call when the path has been calculated. If you don't want a callback (e.g. if you instead poll path.IsDone or use a similar method) you can set this to null.
GraphMask	graphMask	Mask used to specify which graphs should be searched for close nodes. See TraversalConstraint.graphMask. This will override the graphMask on this Seeker.

)

Starts a Multi Target Path from multiple start points to a single target point.

A Multi Target Path will search from all start points to the target point in one search and will return all paths if pathsForAll is true, or only the shortest one if pathsForAll is false.
callback will be called when the path has completed. Callback will not be called if the path is canceled (e.g when a new path is requested before the previous one has completed)