Class TriangleMeshNode Extends MeshNode

int TileIndex

Tile index in the recast or navmesh graph that this node is part of.

int v0

Internal vertex index for the first vertex.

int v1

Internal vertex index for the second vertex.

int v2

Internal vertex index for the third vertex.

const bool InaccuratePathSearch = false

Legacy compatibility.

Enabling this will make pathfinding use node centers, which leads to less accurate paths (but it's faster).

Unity.Profiling.ProfilerMarker MarkerClosest = new Unity.Profiling.ProfilerMarker("MarkerClosest")

Unity.Profiling.ProfilerMarker MarkerDecode = new Unity.Profiling.ProfilerMarker("Decode")

Unity.Profiling.ProfilerMarker MarkerGetVertices = new Unity.Profiling.ProfilerMarker("GetVertex")

uint Area

Connected component that contains the node.

This is visualized in the scene view as differently colored nodes (if the graph coloring mode is set to 'Areas'). Each area represents a set of nodes such that there is no valid path between nodes of different colors.

bool Destroyed

const uint DestroyedNodeIndex = NodeIndexMask - 1

uint Flags

Holds various bitpacked variables.

Bit 0: Walkable Bits 1 through 17: HierarchicalNodeIndex Bit 18: IsHierarchicalNodeDirty Bits 19 through 23: Tag Bits 24 through 31: GraphIndex

NavGraph Graph

Graph which this node belongs to.

If you know the node belongs to a particular graph type, you can cast it to that type: GraphNode node = ...;
GridGraph graph = node.Graph as GridGraph;


Will return null if the node has been destroyed.

uint GraphIndex

Graph which contains this node.

const uint InvalidGraphIndex = (FlagsGraphMask) >> FlagsGraphOffset

const int InvalidNodeIndex = 0

const uint MaxGraphIndex = (FlagsGraphMask-1) >> FlagsGraphOffset

Max number of graphs-1.

const uint MaxHierarchicalNodeIndex = HierarchicalIndexMask >> FlagsHierarchicalIndexOffset

const int MaxTagIndex = 32 - 1

Max number of tags - 1.

Always a power of 2 minus one

uint NodeIndex

Internal unique index.

Every node will get a unique index. This index is not necessarily correlated with e.g the position of the node in the graph.

uint? Penalty

Penalty cost for walking on this node.

This can be used to make it harder/slower to walk over specific nodes. A cost of 1000 (Int3.Precision) corresponds to the cost of moving 1 world unit.

uint Tag

Node tag.

bool? Walkable

True if the node is traversable.

Connection[] connections

All connections from this node.

May be null if the node has no connections.

Int3 position

Position of the node in world space.

int HierarchicalNodeIndex

Hierarchical Node that contains this node.

The graph is divided into clusters of small hierarchical nodes in which there is a path from every node to every other node. This structure is used to speed up connected component calculations which is used to quickly determine if a node is reachable from another node.

bool? IsHierarchicalNodeDirty

Some internal bookkeeping.

int PathNodeVariants

How many path node variants should be created for each node.

This should be a constant for each node type.

Typically this is 1, but for example the triangle mesh node type has 3 variants, one for each edge.

int PathNodeVariants

bool? TemporaryFlag1

Temporary flag for internal purposes.

May only be used in the Unity thread. Must be reset to false after every use.

bool? TemporaryFlag2

Temporary flag for internal purposes.

May only be used in the Unity thread. Must be reset to false after every use.

INavmeshHolder[] _navmeshHolders = new INavmeshHolder[0]

Holds INavmeshHolder references for all graph indices to be able to access them in a performant manner.

uint flags

Bitpacked field holding several pieces of data.

System.Object lockObject = new System.Object()

Used for synchronised access to the _navmeshHolders array.