Class LinkGraph Extends NavGraph
Graph for off-mesh links.
This is an internal graph type which is used to store off-mesh links. An off-mesh link between two nodes A and B is represented as:A <--> N1 <--> N2 <--> B
. where N1 and N2 are two special nodes added to this graph at the exact start and endpoints of the link.
This graph is not persistent. So it will never be saved to disk and a new one will be created each time the game starts.
It is also not possible to query for the nearest node in this graph. The GetNearest method will always return an empty result. This is by design, as all pathfinding should start on the navmesh, not on an off-mesh link.
Inner Types
Public Methods
Number of nodes in the graph.
It's not possible to query for the nearest node in a link graph.
Lower bound on the squared distance from the given point to the closest node in this graph.
Draw gizmos for the graph.
Public Variables
Inherited Public Members
Returns the nearest node to a position using the specified NNConstraint.
Calls a delegate with all nodes in the graph until the delegate returns false.
True if the point is inside the bounding box of this graph.
Moves the nodes in this graph.
Scan the graph.
Captures a snapshot of a part of the graph, to allow restoring it later.
World bounding box for the graph.
Enable to draw gizmos in the Unity scene view.
Index of the graph, used for identification purposes.
Used as an ID of the graph, considered to be unique.
Used in the editor to check if the info screen is open.
Default penalty to apply to all nodes.
Name of the graph.
Is the graph open in the editor.
True if the graph will be included when serializing graph data.
True if the graph should be visible in the editor.
Private/Protected Members
Throws an exception if it is not safe to update internal graph data right now.
Deserializes graph type specific node data.
Destroys all nodes in the graph.
Notifies the system that changes have been made inside these bounds.
Cleans up any unmanaged data that the graph has.
Function for cleaning up references.
Called after all deserialization has been done for all graphs.
Internal method to scan the graph.
Serializes graph type specific node data.
True if the graph exists, false if it has been destroyed.
Deprecated Members
Internal method to scan the graph.