pathfinding

package

v0.0.0-...-fcffdc5 Latest Latest Go to latest Published: Jun 5, 2020 License: GPL-3.0 Imports: 2 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type Cost uint32

const (
	HorizontalCost Cost = 2
	VerticalCost   Cost = 2
	DiagonalCost   Cost = 3
)

we cannot have diagonal costs be the same as the others, because then the path will zig-zag

type Link struct {
	Point
	Cost
}

type Point struct {
	X, Y uint
}

func Search(start Point, goal Point, canTraverse func(Point) bool) []Point

func (p Point) Adjacent(exists func(Point) bool) (px []Link)

func (p Point) Heuristic(goal Point) Cost

compute the largest of the horizontal and vertical distance, because diagonals.

type PointEntry struct {
	// contains filtered or unexported fields
}

type SearchState struct {
	// contains filtered or unexported fields
}

func NewSearchState() *SearchState

func (ss *SearchState) GetEntry(p Point) *PointEntry

func (ss *SearchState) Len() int

func (ss *SearchState) Less(i, j int) bool

func (ss *SearchState) Pop() interface{}

func (ss *SearchState) Push(x interface{})

func (ss *SearchState) Swap(i, j int)