Classes
class	Arc
	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. More...
class	AStar
class	AStarPath
class	AStarz
	Class to search the best path between two nodes on a graph. More...
struct	CloseNode
class	Graph
	Graph structure. It is defined with : It is defined with both a list of nodes and a list of arcs. More...
class	Node
	Basically a node is defined with a geographical position in space. It is also characterized with both collections of outgoing arcs and incoming arcs. More...
class	SortableList
	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. More...
class	Track
	A track is a succession of nodes which have been visited. Thus when it leads to the target node, it is easy to return the result path. These objects are contained in Open and Closed lists.

Enumerations
enum	PathGenerationFailStep { Success , FindStartNode , FindEndNode , FindPath , Mesh }

Functions
delegate double	Heuristic (Node NodeToEvaluate, Node TargetNode)
	A heuristic is a function that associates a value with a node to gauge it considering the node to reach.

Enumeration Type Documentation

◆ PathGenerationFailStep

delegate double Pathfinding.Heuristic	(	Node	NodeToEvaluate,
		Node	TargetNode )

A heuristic is a function that associates a value with a node to gauge it considering the node to reach.