Rebornbuddy
Loading...
Searching...
No Matches
Pathfinding.Graph Member List

This is the complete list of members for Pathfinding.Graph, including all inherited members.

Add2Arcs(Node Node1, Node Node2, float Weight)Pathfinding.Graph
AddArc(Arc NewArc)Pathfinding.Graph
AddArc(Node StartNode, Node EndNode, float Weight)Pathfinding.Graph
AddNode(Node NewNode)Pathfinding.Graph
AddNode(float x, float y, float z)Pathfinding.Graph
AddNode(float x, float y, float z, int id, int[] ignore)Pathfinding.Graph
AddNode(Vector3 xyz, int id, int[] ignore)Pathfinding.Graph
ArcsPathfinding.Graph
Clear()Pathfinding.Graph
CloestNode(Vector3 point)Pathfinding.Graph
ClosestArc2D(Vector3 point, out float distance)Pathfinding.Graph
ClosestNode(float PtX, float PtY, float PtZ, out float Distance, bool IgnorePassableProperty)Pathfinding.Graph
ClosestNode(Vector3 point, out float Distance, bool IgnorePassableProperty)Pathfinding.Graph
ClosestNode2D(Vector3 point)Pathfinding.Graph
ClosestNodes(Vector3 point, int desiredNodes, bool IgnorePassableProperty)Pathfinding.Graph
FarthestNode(float PtX, float PtY, float PtZ, out float Distance, bool IgnorePassableProperty)Pathfinding.Graph
FarthestNodes(Vector3 point, int desiredNodes, bool IgnorePassableProperty)Pathfinding.Graph
FindClosest(Vector3 loc, Predicate< Node > predicate=null)Pathfinding.Graph
freeIdPathfinding.Graph
FreeIds(int wanted)Pathfinding.Graph
Graph()Pathfinding.Graph
NodeById(int id)Pathfinding.Graph
NodesPathfinding.Graph
RemoveAllArcs()Pathfinding.Graph
RemoveArc(Arc ArcToRemove)Pathfinding.Graph
RemoveNode(Node NodeToRemove)Pathfinding.Graph
Search(Vector3 loc, float maxRange)Pathfinding.Graph
Search(Node loc, float maxRange)Pathfinding.Graph
this[int key]Pathfinding.Graph