Find a path between two nodes.
If the end node cannot be reached through the navigation graph, the last node in the path will be the nearest the end node.
The start and end positions are used to calculate traversal costs. (The y-values impact the result.)
The reference ID of the starting node.
The reference ID of the ending node.
The starting position in world space.
The ending position in world space.
The query filter.
The result of the pathfinding operation.
Find a path between two nodes.
If the end node cannot be reached through the navigation graph, the last node in the path will be the nearest the end node.
The start and end positions are used to calculate traversal costs. (The y-values impact the result.)