README
¶
github.com/gbkr-com/astar
The A* path finding algorithm.
The package contains a sample application which illustrates how the algorithm finds paths.
The landscape for path finding comprises cells with varying colours: the darker the colour the higher the cost of passing through the cell. The darkest cells are blocked. The objective for the algorithm is to find the lowest cost path from the top left to the bottom right of the landscape.
Use the Randomisebutton to change the landscape: then use theRoute button to
show the path.
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
Types ¶
type Interface ¶
type Interface interface {
// Adjacent returns a map of the adjacent points with their associated
// cost.
//
Adjacent(int) map[int]float64
// Estimate returns the estimated cost of moving from the given point to the
// goal. Known as the heuristic function (h) in the literature.
//
Estimate(int, int) float64
}
Interface defines the problem space for the A* algorithm. Whatever the implemention, every point in the problem space must have a unique integer label.
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.