Click or drag to resize

Pathfinding Namespace

 
Classes
  ClassDescription
Public classArc
An arc is defined with its two extremity nodes StartNode and EndNode therefore it is oriented. It is also characterized by a crossing factor named 'Weight'. This value represents the difficulty to reach the ending node from the starting one.
Public classAStar
Public classAStarPath
Public classAStarz
Class to search the best path between two nodes on a graph.
Public classGraph
Graph structure. It is defined with : It is defined with both a list of nodes and a list of arcs.
Public classNAMESPACE_PLACEHOLDER
Public classNode
Basically a node is defined with a geographical position in space. It is also characterized with both collections of outgoing arcs and incoming arcs.
Public classSortableList
The SortableList allows to maintain a list sorted as long as needed. If no IComparer interface has been provided at construction, then the list expects the Objects to implement IComparer. If the list is not sorted it behaves like an ordinary list. When sorted, the list's "Add" method will put new objects at the right place. As well the "Contains" and "IndexOf" methods will perform a binary search.
Structures
  StructureDescription
Public structureCloseNode
Delegates
  DelegateDescription
Public delegateHeuristic
A heuristic is a function that associates a value with a node to gauge it considering the node to reach.
Public delegateSortableListEquality
Defines an equality for two objects
Enumerations
  EnumerationDescription
Public enumerationPathGenerationFailStep