Category:A* search

From LiteratePrograms

A^* search is a graph search algorithm that finds a path to a goal node, given a distance metric that estimates the distance to the goal from any given node. A simple example is a graph where each point corresponds to a point on a map and the metric is the Euclidean distance from the given point to the goal.

Articles in category "A* search"

There is 1 article in this category.

A

• A* search (JavaScript)