IDAStarIterativeDeepeningAStarT Method

public static Tuple<List<IEdge<T>>?, int> IterativeDeepeningAStar<T>(
	T start,
	T goal,
	int maxDepth = -1
)
where T : Object, INode<T>

Parameters

start  T

The starting node.

goal  T

The goal node.

maxDepth  Int32  (Optional)

The maximum depth the algorithm should go to. Negative values indicate infinite depth.

Type Parameters

T

The type of the nodes of the graph

Return Value

• (shortest path, length) if the path was found
• (null, bound) where bound is the estimated length of shortest path, if the goal wasn't reached within the given maxDepth.
• (null, -1) if there doesn't exist a path between >start and goal.

Reference