Class GraphNode

Public Abstract

Base class for all nodes.

Public Methods

AddConnection (node, cost)

Add a connection from this node to the specified node.

Public Abstract
ClearConnections (alsoReverse)

Remove all connections from this node.

Public Abstract
ContainsConnection (node)

Checks if this node has a connection to the specified node.

Public
DeserializeNode (ctx)

Deserializes the node data from a byte array.

Public
DeserializeReferences (ctx)

Used to deserialize references to other nodes e.g connections.

Public
Destroy ()

Destroys the node.

Public
GetConnections (action)

Calls the delegate with all connections from this node.

Public Abstract
GetGizmoHashCode ()

Hash code used for checking if the gizmos need to be updated.

Public
GetPortal (other, left, right, backwards)

Add a portal from this node to the specified node.

Public
Open (path, pathNode, handler)

Open the node.

Public Abstract
RandomPointOnSurface ()

A random point on the surface of the node.

Public
RemoveConnection (node)

Removes any connection from this node to the specified node.

Public Abstract
SerializeNode (ctx)

Serialized the node data to a byte array.

Public
SerializeReferences (ctx)

Used to serialize references to other nodes e.g connections.

Public
SetConnectivityDirty ()

Inform the system that the node's connectivity has changed.

Public
SurfaceArea ()

The surface area of the node in square world units.

Public
UpdateRecursiveG (path, pathNode, handler)
Public

Public Variables

Area

Connected component that contains the node.

Public
Destroyed
Public
Flags

Holds various bitpacked variables.

Public
Graph

Graph which this node belongs to.

Public
GraphIndex

Graph which contains this node.

Public
MaxGraphIndex

Max number of graphs-1.

Public
MaxHierarchicalNodeIndex
Public
MaxTagIndex

Max number of tags - 1.

Public
NodeIndex

Internal unique index.

Public
Penalty

Penalty cost for walking on this node.

Public
position

Position of the node in world space.

Public
Tag

Node tag.

Public
Walkable

True if the node is traversable.

Public

Private/Protected Members

DestroyedNodeIndex
Private
flags

Bitpacked field holding several pieces of data.

Protected
FlagsGraphMask

Mask of graph index bits.

Private
FlagsGraphOffset

Start of graph index bits.

Private
FlagsHierarchicalIndexOffset

Start of hierarchical node index bits.

Private
FlagsTagMask

Mask of tag bits.

Private
FlagsTagOffset

Start of tag bits.

Private
FlagsWalkableMask

Mask of the walkable bit.

Private
FlagsWalkableOffset

Position of the walkable bit.

Private
HierarchicalDirtyMask

Mask of the IsHierarchicalNodeDirty bit.

Private
HierarchicalDirtyOffset

Start of IsHierarchicalNodeDirty bits.

Private
HierarchicalIndexMask

Mask of hierarchical node index bits.

Private
HierarchicalNodeIndex

Hierarchical Node that contains this node.

Package
IsHierarchicalNodeDirty

Some internal bookkeeping.

Package
nodeIndex

Internal unique index.

Private
NodeIndexMask
Private
penalty

Penalty cost for walking on this node.

Private
TemporaryFlag1

Temporary flag for internal purposes.

Package
TemporaryFlag1Mask
Private
TemporaryFlag2

Temporary flag for internal purposes.

Package
TemporaryFlag2Mask
Private

Deprecated Members

RecalculateConnectionCosts ()

Recalculates a node's connection costs.

Public